./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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-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 dad2aa6a134d55c6f9e0680e747fcd11c50dca1f4f191403c757088bda5dc252 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:40:45,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:40:45,486 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:40:45,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:40:45,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:40:45,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:40:45,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:40:45,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:40:45,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:40:45,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:40:45,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:40:45,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:40:45,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:40:45,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:40:45,527 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:40:45,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:40:45,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:40:45,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:40:45,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:40:45,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:40:45,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:40:45,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:40:45,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:40:45,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:40:45,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:40:45,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:40:45,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:40:45,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:40:45,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:40:45,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:40:45,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:40:45,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:40:45,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:40:45,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:40:45,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:40:45,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:40:45,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:40:45,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:40:45,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:40:45,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:40:45,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:40:45,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:40:45,539 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 -> dad2aa6a134d55c6f9e0680e747fcd11c50dca1f4f191403c757088bda5dc252 [2024-10-11 03:40:45,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:40:45,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:40:45,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:40:45,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:40:45,837 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:40:45,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-11 03:40:47,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:40:47,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:40:47,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-11 03:40:47,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ce517ad5/7d914c8b35c94cfba1002d6af1b0bcce/FLAGd762f9dcd [2024-10-11 03:40:47,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ce517ad5/7d914c8b35c94cfba1002d6af1b0bcce [2024-10-11 03:40:47,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:40:47,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:40:47,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:40:47,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:40:48,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:40:48,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:40:47" (1/1) ... [2024-10-11 03:40:48,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b5aa46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:48, skipping insertion in model container [2024-10-11 03:40:48,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:40:47" (1/1) ... [2024-10-11 03:40:48,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:40:48,843 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32670,32683] [2024-10-11 03:40:48,917 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[39748,39761] [2024-10-11 03:40:49,062 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[66949,66962] [2024-10-11 03:40:49,089 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[76032,76045] [2024-10-11 03:40:49,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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[82743,82756] [2024-10-11 03:40:49,149 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[94707,94720] [2024-10-11 03:40:49,176 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[103680,103693] [2024-10-11 03:40:49,205 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[111745,111758] [2024-10-11 03:40:49,296 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[150437,150450] [2024-10-11 03:40:49,313 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[153987,154000] [2024-10-11 03:40:49,347 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[163014,163027] [2024-10-11 03:40:49,365 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[169687,169700] [2024-10-11 03:40:49,431 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[195501,195514] [2024-10-11 03:40:49,496 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[227497,227510] [2024-10-11 03:40:49,552 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[257825,257838] [2024-10-11 03:40:49,611 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[288277,288290] [2024-10-11 03:40:49,679 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[321714,321727] [2024-10-11 03:40:49,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:40:49,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:40:50,071 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32670,32683] [2024-10-11 03:40:50,094 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[39748,39761] [2024-10-11 03:40:50,156 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[66949,66962] [2024-10-11 03:40:50,171 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[76032,76045] [2024-10-11 03:40:50,181 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[82743,82756] [2024-10-11 03:40:50,198 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[94707,94720] [2024-10-11 03:40:50,213 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[103680,103693] [2024-10-11 03:40:50,230 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[111745,111758] [2024-10-11 03:40:50,285 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[150437,150450] [2024-10-11 03:40:50,291 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[153987,154000] [2024-10-11 03:40:50,303 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[163014,163027] [2024-10-11 03:40:50,313 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[169687,169700] [2024-10-11 03:40:50,349 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[195501,195514] [2024-10-11 03:40:50,390 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[227497,227510] [2024-10-11 03:40:50,429 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[257825,257838] [2024-10-11 03:40:50,469 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[288277,288290] [2024-10-11 03:40:50,560 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[321714,321727] [2024-10-11 03:40:50,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:40:50,776 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:40:50,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50 WrapperNode [2024-10-11 03:40:50,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:40:50,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:40:50,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:40:50,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:40:50,789 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:40:50" (1/1) ... [2024-10-11 03:40:50,867 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:40:50" (1/1) ... [2024-10-11 03:40:51,303 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19399 [2024-10-11 03:40:51,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:40:51,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:40:51,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:40:51,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:40:51,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,541 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:40:51,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:40:51,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:40:51,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:40:51,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:40:51,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (1/1) ... [2024-10-11 03:40:51,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:40:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:51,936 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:40:51,942 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:40:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:40:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:40:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:40:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:40:52,575 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:40:52,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:41:00,384 INFO L? ?]: Removed 3880 outVars from TransFormulas that were not future-live. [2024-10-11 03:41:00,384 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:41:00,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:41:00,572 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:41:00,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:41:00 BoogieIcfgContainer [2024-10-11 03:41:00,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:41:00,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:41:00,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:41:00,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:41:00,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:40:47" (1/3) ... [2024-10-11 03:41:00,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba5874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:41:00, skipping insertion in model container [2024-10-11 03:41:00,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:50" (2/3) ... [2024-10-11 03:41:00,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba5874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:41:00, skipping insertion in model container [2024-10-11 03:41:00,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:41:00" (3/3) ... [2024-10-11 03:41:00,582 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-11 03:41:00,602 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:41:00,603 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-11 03:41:00,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:41:00,792 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;@645badf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:41:00,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-11 03:41:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 3730 states, 3712 states have (on average 1.78125) internal successors, (6612), 3729 states have internal predecessors, (6612), 0 states have call successors, (0), 0 states 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:41:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:41:00,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:00,852 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] [2024-10-11 03:41:00,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash -354004625, now seen corresponding path program 1 times [2024-10-11 03:41:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901728381] [2024-10-11 03:41:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:01,730 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:41:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901728381] [2024-10-11 03:41:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901728381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:41:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021039101] [2024-10-11 03:41:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:01,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:41:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:01,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:41:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:41:01,782 INFO L87 Difference]: Start difference. First operand has 3730 states, 3712 states have (on average 1.78125) internal successors, (6612), 3729 states have internal predecessors, (6612), 0 states have call successors, (0), 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 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:41:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:06,029 INFO L93 Difference]: Finished difference Result 7042 states and 12220 transitions. [2024-10-11 03:41:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:41:06,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:41:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:06,063 INFO L225 Difference]: With dead ends: 7042 [2024-10-11 03:41:06,063 INFO L226 Difference]: Without dead ends: 4525 [2024-10-11 03:41:06,073 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:41:06,077 INFO L432 NwaCegarLoop]: 2968 mSDtfsCounter, 20492 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 3557 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20492 SdHoareTripleChecker+Valid, 4278 SdHoareTripleChecker+Invalid, 3692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:06,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20492 Valid, 4278 Invalid, 3692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [135 Valid, 3557 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 03:41:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2024-10-11 03:41:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4500. [2024-10-11 03:41:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4500 states, 4483 states have (on average 1.3002453714030784) internal successors, (5829), 4499 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states 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:41:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 5829 transitions. [2024-10-11 03:41:06,258 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 5829 transitions. Word has length 64 [2024-10-11 03:41:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:06,258 INFO L471 AbstractCegarLoop]: Abstraction has 4500 states and 5829 transitions. [2024-10-11 03:41:06,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:41:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 5829 transitions. [2024-10-11 03:41:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:41:06,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:06,269 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] [2024-10-11 03:41:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:41:06,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 838909937, now seen corresponding path program 1 times [2024-10-11 03:41:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242515792] [2024-10-11 03:41:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:06,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:41:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:06,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242515792] [2024-10-11 03:41:06,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242515792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:06,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:41:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144116919] [2024-10-11 03:41:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:41:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:41:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:41:06,603 INFO L87 Difference]: Start difference. First operand 4500 states and 5829 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:41:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:09,057 INFO L93 Difference]: Finished difference Result 8464 states and 10988 transitions. [2024-10-11 03:41:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:41:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 03:41:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:09,080 INFO L225 Difference]: With dead ends: 8464 [2024-10-11 03:41:09,080 INFO L226 Difference]: Without dead ends: 5685 [2024-10-11 03:41:09,087 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:41:09,088 INFO L432 NwaCegarLoop]: 1912 mSDtfsCounter, 13269 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13269 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:09,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13269 Valid, 2581 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:41:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2024-10-11 03:41:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5655. [2024-10-11 03:41:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5638 states have (on average 1.3061369279886486) internal successors, (7364), 5654 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states 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:41:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 7364 transitions. [2024-10-11 03:41:09,214 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 7364 transitions. Word has length 65 [2024-10-11 03:41:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 5655 states and 7364 transitions. [2024-10-11 03:41:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:41:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 7364 transitions. [2024-10-11 03:41:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:41:09,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:09,224 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] [2024-10-11 03:41:09,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:41:09,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1512929807, now seen corresponding path program 1 times [2024-10-11 03:41:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012082053] [2024-10-11 03:41:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:09,449 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:41:09,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:09,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012082053] [2024-10-11 03:41:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012082053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:09,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:09,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:41:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029223536] [2024-10-11 03:41:09,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:09,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:41:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:41:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:41:09,454 INFO L87 Difference]: Start difference. First operand 5655 states and 7364 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:41:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:11,387 INFO L93 Difference]: Finished difference Result 11340 states and 14792 transitions. [2024-10-11 03:41:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:41:11,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 03:41:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:11,412 INFO L225 Difference]: With dead ends: 11340 [2024-10-11 03:41:11,413 INFO L226 Difference]: Without dead ends: 7094 [2024-10-11 03:41:11,421 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:41:11,424 INFO L432 NwaCegarLoop]: 1610 mSDtfsCounter, 11557 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11557 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:11,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11557 Valid, 2244 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:41:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2024-10-11 03:41:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7074. [2024-10-11 03:41:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 7057 states have (on average 1.308629729346748) internal successors, (9235), 7073 states have internal predecessors, (9235), 0 states have call successors, (0), 0 states 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:41:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9235 transitions. [2024-10-11 03:41:11,577 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9235 transitions. Word has length 65 [2024-10-11 03:41:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:11,579 INFO L471 AbstractCegarLoop]: Abstraction has 7074 states and 9235 transitions. [2024-10-11 03:41:11,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:41:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9235 transitions. [2024-10-11 03:41:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:41:11,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:11,589 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] [2024-10-11 03:41:11,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:41:11,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:11,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1700677701, now seen corresponding path program 1 times [2024-10-11 03:41:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737932991] [2024-10-11 03:41:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:11,972 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:41:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737932991] [2024-10-11 03:41:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737932991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:11,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:41:11,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660013101] [2024-10-11 03:41:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:41:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:41:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:41:11,976 INFO L87 Difference]: Start difference. First operand 7074 states and 9235 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:41:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:13,357 INFO L93 Difference]: Finished difference Result 13796 states and 18188 transitions. [2024-10-11 03:41:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:41:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:41:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:13,390 INFO L225 Difference]: With dead ends: 13796 [2024-10-11 03:41:13,390 INFO L226 Difference]: Without dead ends: 9214 [2024-10-11 03:41:13,399 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:41:13,401 INFO L432 NwaCegarLoop]: 1468 mSDtfsCounter, 9715 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9715 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:13,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9715 Valid, 2008 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:41:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9214 states. [2024-10-11 03:41:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9214 to 9174. [2024-10-11 03:41:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9174 states, 9157 states have (on average 1.322703942339194) internal successors, (12112), 9173 states have internal predecessors, (12112), 0 states have call successors, (0), 0 states 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:41:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9174 states to 9174 states and 12112 transitions. [2024-10-11 03:41:13,582 INFO L78 Accepts]: Start accepts. Automaton has 9174 states and 12112 transitions. Word has length 66 [2024-10-11 03:41:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:13,583 INFO L471 AbstractCegarLoop]: Abstraction has 9174 states and 12112 transitions. [2024-10-11 03:41:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:41:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9174 states and 12112 transitions. [2024-10-11 03:41:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:41:13,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:13,592 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] [2024-10-11 03:41:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:41:13,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1596749287, now seen corresponding path program 1 times [2024-10-11 03:41:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087255976] [2024-10-11 03:41:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:14,204 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:41:14,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:14,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087255976] [2024-10-11 03:41:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087255976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:14,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:14,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:41:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916369402] [2024-10-11 03:41:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:14,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:41:14,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:41:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:41:14,209 INFO L87 Difference]: Start difference. First operand 9174 states and 12112 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:41:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:16,542 INFO L93 Difference]: Finished difference Result 12397 states and 16659 transitions. [2024-10-11 03:41:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:41:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:41:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:16,569 INFO L225 Difference]: With dead ends: 12397 [2024-10-11 03:41:16,569 INFO L226 Difference]: Without dead ends: 10863 [2024-10-11 03:41:16,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:41:16,575 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 10018 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10018 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 4240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:16,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10018 Valid, 4993 Invalid, 4240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 03:41:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10863 states. [2024-10-11 03:41:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10863 to 9014. [2024-10-11 03:41:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9014 states, 8997 states have (on average 1.322107369123041) internal successors, (11895), 9013 states have internal predecessors, (11895), 0 states have call successors, (0), 0 states 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:41:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 11895 transitions. [2024-10-11 03:41:16,861 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 11895 transitions. Word has length 67 [2024-10-11 03:41:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:16,862 INFO L471 AbstractCegarLoop]: Abstraction has 9014 states and 11895 transitions. [2024-10-11 03:41:16,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:41:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 11895 transitions. [2024-10-11 03:41:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:41:16,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:16,873 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] [2024-10-11 03:41:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:41:16,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -738498771, now seen corresponding path program 1 times [2024-10-11 03:41:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988780889] [2024-10-11 03:41:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:17,395 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:41:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:17,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988780889] [2024-10-11 03:41:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988780889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127981035] [2024-10-11 03:41:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:17,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:17,400 INFO L87 Difference]: Start difference. First operand 9014 states and 11895 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:41:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:20,824 INFO L93 Difference]: Finished difference Result 15295 states and 20627 transitions. [2024-10-11 03:41:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:41:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:41:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:20,857 INFO L225 Difference]: With dead ends: 15295 [2024-10-11 03:41:20,857 INFO L226 Difference]: Without dead ends: 13883 [2024-10-11 03:41:20,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:41:20,867 INFO L432 NwaCegarLoop]: 1472 mSDtfsCounter, 11209 mSDsluCounter, 4908 mSDsCounter, 0 mSdLazyCounter, 6499 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11209 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 6625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:20,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11209 Valid, 6380 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6499 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 03:41:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13883 states. [2024-10-11 03:41:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13883 to 8952. [2024-10-11 03:41:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8952 states, 8935 states have (on average 1.3217683268047007) internal successors, (11810), 8951 states have internal predecessors, (11810), 0 states have call successors, (0), 0 states 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:41:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 11810 transitions. [2024-10-11 03:41:21,074 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 11810 transitions. Word has length 67 [2024-10-11 03:41:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 8952 states and 11810 transitions. [2024-10-11 03:41:21,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:41:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 11810 transitions. [2024-10-11 03:41:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:41:21,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:21,082 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] [2024-10-11 03:41:21,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:41:21,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash 757912053, now seen corresponding path program 1 times [2024-10-11 03:41:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:21,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647537119] [2024-10-11 03:41:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:22,149 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:41:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647537119] [2024-10-11 03:41:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647537119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:41:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756188905] [2024-10-11 03:41:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:41:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:41:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:41:22,152 INFO L87 Difference]: Start difference. First operand 8952 states and 11810 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:23,623 INFO L93 Difference]: Finished difference Result 11143 states and 14903 transitions. [2024-10-11 03:41:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:41:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 03:41:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:23,643 INFO L225 Difference]: With dead ends: 11143 [2024-10-11 03:41:23,644 INFO L226 Difference]: Without dead ends: 11139 [2024-10-11 03:41:23,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:41:23,651 INFO L432 NwaCegarLoop]: 2468 mSDtfsCounter, 10201 mSDsluCounter, 11671 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10201 SdHoareTripleChecker+Valid, 14139 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:23,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10201 Valid, 14139 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:41:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2024-10-11 03:41:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 8948. [2024-10-11 03:41:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8948 states, 8932 states have (on average 1.3217644424540975) internal successors, (11806), 8947 states have internal predecessors, (11806), 0 states have call successors, (0), 0 states 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:41:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8948 states to 8948 states and 11806 transitions. [2024-10-11 03:41:23,885 INFO L78 Accepts]: Start accepts. Automaton has 8948 states and 11806 transitions. Word has length 68 [2024-10-11 03:41:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 8948 states and 11806 transitions. [2024-10-11 03:41:23,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8948 states and 11806 transitions. [2024-10-11 03:41:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:41:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:23,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] [2024-10-11 03:41:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:41:23,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1434028365, now seen corresponding path program 1 times [2024-10-11 03:41:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489332603] [2024-10-11 03:41:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:24,425 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:41:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489332603] [2024-10-11 03:41:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489332603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425542951] [2024-10-11 03:41:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:24,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:24,429 INFO L87 Difference]: Start difference. First operand 8948 states and 11806 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:27,575 INFO L93 Difference]: Finished difference Result 10535 states and 13951 transitions. [2024-10-11 03:41:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:41:27,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 03:41:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:27,594 INFO L225 Difference]: With dead ends: 10535 [2024-10-11 03:41:27,595 INFO L226 Difference]: Without dead ends: 10529 [2024-10-11 03:41:27,601 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:41:27,602 INFO L432 NwaCegarLoop]: 1475 mSDtfsCounter, 8297 mSDsluCounter, 5817 mSDsCounter, 0 mSdLazyCounter, 5858 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8297 SdHoareTripleChecker+Valid, 7292 SdHoareTripleChecker+Invalid, 5878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:27,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8297 Valid, 7292 Invalid, 5878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5858 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:41:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2024-10-11 03:41:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 8948. [2024-10-11 03:41:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8948 states, 8932 states have (on average 1.3216524854455889) internal successors, (11805), 8947 states have internal predecessors, (11805), 0 states have call successors, (0), 0 states 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:41:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8948 states to 8948 states and 11805 transitions. [2024-10-11 03:41:27,760 INFO L78 Accepts]: Start accepts. Automaton has 8948 states and 11805 transitions. Word has length 68 [2024-10-11 03:41:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:27,760 INFO L471 AbstractCegarLoop]: Abstraction has 8948 states and 11805 transitions. [2024-10-11 03:41:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 8948 states and 11805 transitions. [2024-10-11 03:41:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:41:27,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:27,767 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] [2024-10-11 03:41:27,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:41:27,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:27,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -896669404, now seen corresponding path program 1 times [2024-10-11 03:41:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746124767] [2024-10-11 03:41:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:28,229 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:41:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746124767] [2024-10-11 03:41:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746124767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851269584] [2024-10-11 03:41:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:28,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:28,233 INFO L87 Difference]: Start difference. First operand 8948 states and 11805 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:31,370 INFO L93 Difference]: Finished difference Result 11324 states and 14897 transitions. [2024-10-11 03:41:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:41:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 03:41:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:31,387 INFO L225 Difference]: With dead ends: 11324 [2024-10-11 03:41:31,387 INFO L226 Difference]: Without dead ends: 11315 [2024-10-11 03:41:31,393 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:41:31,394 INFO L432 NwaCegarLoop]: 1462 mSDtfsCounter, 8191 mSDsluCounter, 5865 mSDsCounter, 0 mSdLazyCounter, 6379 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8191 SdHoareTripleChecker+Valid, 7327 SdHoareTripleChecker+Invalid, 6425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:31,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8191 Valid, 7327 Invalid, 6425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6379 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:41:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11315 states. [2024-10-11 03:41:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11315 to 8948. [2024-10-11 03:41:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8948 states, 8932 states have (on average 1.3215405284370803) internal successors, (11804), 8947 states have internal predecessors, (11804), 0 states have call successors, (0), 0 states 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:41:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8948 states to 8948 states and 11804 transitions. [2024-10-11 03:41:31,580 INFO L78 Accepts]: Start accepts. Automaton has 8948 states and 11804 transitions. Word has length 68 [2024-10-11 03:41:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:31,581 INFO L471 AbstractCegarLoop]: Abstraction has 8948 states and 11804 transitions. [2024-10-11 03:41:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8948 states and 11804 transitions. [2024-10-11 03:41:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:41:31,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:31,588 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] [2024-10-11 03:41:31,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:41:31,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:31,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1848914971, now seen corresponding path program 1 times [2024-10-11 03:41:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388534962] [2024-10-11 03:41:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:32,193 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:41:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388534962] [2024-10-11 03:41:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388534962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:41:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338236966] [2024-10-11 03:41:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:41:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:41:32,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:41:32,195 INFO L87 Difference]: Start difference. First operand 8948 states and 11804 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:33,556 INFO L93 Difference]: Finished difference Result 12757 states and 17264 transitions. [2024-10-11 03:41:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:41:33,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 03:41:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:33,568 INFO L225 Difference]: With dead ends: 12757 [2024-10-11 03:41:33,568 INFO L226 Difference]: Without dead ends: 11342 [2024-10-11 03:41:33,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:41:33,575 INFO L432 NwaCegarLoop]: 2314 mSDtfsCounter, 13458 mSDsluCounter, 7840 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13458 SdHoareTripleChecker+Valid, 10154 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:33,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13458 Valid, 10154 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:41:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11342 states. [2024-10-11 03:41:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11342 to 8879. [2024-10-11 03:41:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8879 states, 8864 states have (on average 1.3214124548736461) internal successors, (11713), 8878 states have internal predecessors, (11713), 0 states have call successors, (0), 0 states 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:41:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 11713 transitions. [2024-10-11 03:41:33,728 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 11713 transitions. Word has length 68 [2024-10-11 03:41:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 8879 states and 11713 transitions. [2024-10-11 03:41:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 11713 transitions. [2024-10-11 03:41:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:41:33,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:33,735 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] [2024-10-11 03:41:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:41:33,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash 267145537, now seen corresponding path program 1 times [2024-10-11 03:41:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154115171] [2024-10-11 03:41:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:34,494 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:41:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154115171] [2024-10-11 03:41:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154115171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:41:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288664734] [2024-10-11 03:41:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:34,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:41:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:41:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:41:34,497 INFO L87 Difference]: Start difference. First operand 8879 states and 11713 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:36,293 INFO L93 Difference]: Finished difference Result 11718 states and 15612 transitions. [2024-10-11 03:41:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:41:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-11 03:41:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:36,307 INFO L225 Difference]: With dead ends: 11718 [2024-10-11 03:41:36,307 INFO L226 Difference]: Without dead ends: 11709 [2024-10-11 03:41:36,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:41:36,311 INFO L432 NwaCegarLoop]: 2391 mSDtfsCounter, 15407 mSDsluCounter, 10548 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15407 SdHoareTripleChecker+Valid, 12939 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:36,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15407 Valid, 12939 Invalid, 1712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:41:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2024-10-11 03:41:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 8870. [2024-10-11 03:41:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8856 states have (on average 1.3214769647696476) internal successors, (11703), 8869 states have internal predecessors, (11703), 0 states have call successors, (0), 0 states 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:41:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 11703 transitions. [2024-10-11 03:41:36,466 INFO L78 Accepts]: Start accepts. Automaton has 8870 states and 11703 transitions. Word has length 69 [2024-10-11 03:41:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:36,467 INFO L471 AbstractCegarLoop]: Abstraction has 8870 states and 11703 transitions. [2024-10-11 03:41:36,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8870 states and 11703 transitions. [2024-10-11 03:41:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:41:36,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:36,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:36,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:41:36,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash 554101842, now seen corresponding path program 1 times [2024-10-11 03:41:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:36,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809774846] [2024-10-11 03:41:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:41:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:37,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809774846] [2024-10-11 03:41:37,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809774846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:37,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:37,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:41:37,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813236479] [2024-10-11 03:41:37,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:37,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:41:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:37,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:41:37,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:41:37,229 INFO L87 Difference]: Start difference. First operand 8870 states and 11703 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:41,114 INFO L93 Difference]: Finished difference Result 20527 states and 28000 transitions. [2024-10-11 03:41:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 03:41:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-11 03:41:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:41,139 INFO L225 Difference]: With dead ends: 20527 [2024-10-11 03:41:41,139 INFO L226 Difference]: Without dead ends: 20515 [2024-10-11 03:41:41,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:41:41,146 INFO L432 NwaCegarLoop]: 2351 mSDtfsCounter, 16100 mSDsluCounter, 17988 mSDsCounter, 0 mSdLazyCounter, 5268 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16100 SdHoareTripleChecker+Valid, 20339 SdHoareTripleChecker+Invalid, 5378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 5268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:41,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16100 Valid, 20339 Invalid, 5378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 5268 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:41:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2024-10-11 03:41:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 8863. [2024-10-11 03:41:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8863 states, 8849 states have (on average 1.3216182619505028) internal successors, (11695), 8862 states have internal predecessors, (11695), 0 states have call successors, (0), 0 states 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:41:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 11695 transitions. [2024-10-11 03:41:41,332 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 11695 transitions. Word has length 69 [2024-10-11 03:41:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:41,333 INFO L471 AbstractCegarLoop]: Abstraction has 8863 states and 11695 transitions. [2024-10-11 03:41:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 11695 transitions. [2024-10-11 03:41:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:41:41,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:41,340 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] [2024-10-11 03:41:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:41:41,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -631202535, now seen corresponding path program 1 times [2024-10-11 03:41:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348188041] [2024-10-11 03:41:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:41,548 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:41:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348188041] [2024-10-11 03:41:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348188041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:41,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006952126] [2024-10-11 03:41:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:41,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:41,551 INFO L87 Difference]: Start difference. First operand 8863 states and 11695 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:41,712 INFO L93 Difference]: Finished difference Result 12906 states and 17351 transitions. [2024-10-11 03:41:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-11 03:41:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:41,724 INFO L225 Difference]: With dead ends: 12906 [2024-10-11 03:41:41,725 INFO L226 Difference]: Without dead ends: 7984 [2024-10-11 03:41:41,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:41,733 INFO L432 NwaCegarLoop]: 1997 mSDtfsCounter, 1972 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:41,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 2712 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7984 states. [2024-10-11 03:41:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7984 to 7965. [2024-10-11 03:41:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7955 states have (on average 1.340289126335638) internal successors, (10662), 7964 states have internal predecessors, (10662), 0 states have call successors, (0), 0 states 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:41:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 10662 transitions. [2024-10-11 03:41:41,841 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 10662 transitions. Word has length 69 [2024-10-11 03:41:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:41,841 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 10662 transitions. [2024-10-11 03:41:41,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:41:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 10662 transitions. [2024-10-11 03:41:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:41:41,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:41,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:41,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:41:41,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:41,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 208427501, now seen corresponding path program 1 times [2024-10-11 03:41:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:41,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249059704] [2024-10-11 03:41:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:42,213 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:41:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:42,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249059704] [2024-10-11 03:41:42,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249059704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:42,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852893689] [2024-10-11 03:41:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:42,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:42,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:42,215 INFO L87 Difference]: Start difference. First operand 7965 states and 10662 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:44,711 INFO L93 Difference]: Finished difference Result 12414 states and 16963 transitions. [2024-10-11 03:41:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:41:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 03:41:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:44,723 INFO L225 Difference]: With dead ends: 12414 [2024-10-11 03:41:44,723 INFO L226 Difference]: Without dead ends: 10406 [2024-10-11 03:41:44,728 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:41:44,728 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 6308 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 4910 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6308 SdHoareTripleChecker+Valid, 5693 SdHoareTripleChecker+Invalid, 4950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:44,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6308 Valid, 5693 Invalid, 4950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4910 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:41:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10406 states. [2024-10-11 03:41:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10406 to 7965. [2024-10-11 03:41:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7955 states have (on average 1.3401634192331866) internal successors, (10661), 7964 states have internal predecessors, (10661), 0 states have call successors, (0), 0 states 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:41:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 10661 transitions. [2024-10-11 03:41:44,837 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 10661 transitions. Word has length 70 [2024-10-11 03:41:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:44,838 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 10661 transitions. [2024-10-11 03:41:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 10661 transitions. [2024-10-11 03:41:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:41:44,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:44,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:44,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:41:44,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:44,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1665056200, now seen corresponding path program 1 times [2024-10-11 03:41:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:44,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046293927] [2024-10-11 03:41:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:45,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:41:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:45,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046293927] [2024-10-11 03:41:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046293927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156253973] [2024-10-11 03:41:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:45,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:45,178 INFO L87 Difference]: Start difference. First operand 7965 states and 10661 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:47,901 INFO L93 Difference]: Finished difference Result 15913 states and 21943 transitions. [2024-10-11 03:41:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:41:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 03:41:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:47,916 INFO L225 Difference]: With dead ends: 15913 [2024-10-11 03:41:47,916 INFO L226 Difference]: Without dead ends: 13836 [2024-10-11 03:41:47,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:41:47,923 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 8628 mSDsluCounter, 3886 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8628 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:47,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8628 Valid, 5046 Invalid, 5102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 03:41:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13836 states. [2024-10-11 03:41:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13836 to 7965. [2024-10-11 03:41:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7955 states have (on average 1.3400377121307354) internal successors, (10660), 7964 states have internal predecessors, (10660), 0 states have call successors, (0), 0 states 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:41:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 10660 transitions. [2024-10-11 03:41:48,047 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 10660 transitions. Word has length 70 [2024-10-11 03:41:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:48,048 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 10660 transitions. [2024-10-11 03:41:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 10660 transitions. [2024-10-11 03:41:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:41:48,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:48,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:41:48,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:48,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1937924781, now seen corresponding path program 1 times [2024-10-11 03:41:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190981790] [2024-10-11 03:41:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:48,518 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:41:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190981790] [2024-10-11 03:41:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190981790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:41:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745101207] [2024-10-11 03:41:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:41:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:48,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:41:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:41:48,522 INFO L87 Difference]: Start difference. First operand 7965 states and 10660 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:50,363 INFO L93 Difference]: Finished difference Result 11958 states and 16418 transitions. [2024-10-11 03:41:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:41:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 03:41:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:50,375 INFO L225 Difference]: With dead ends: 11958 [2024-10-11 03:41:50,375 INFO L226 Difference]: Without dead ends: 9537 [2024-10-11 03:41:50,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:41:50,382 INFO L432 NwaCegarLoop]: 1133 mSDtfsCounter, 7147 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7147 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:50,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7147 Valid, 3742 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:41:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2024-10-11 03:41:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7965. [2024-10-11 03:41:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7955 states have (on average 1.339912005028284) internal successors, (10659), 7964 states have internal predecessors, (10659), 0 states have call successors, (0), 0 states 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:41:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 10659 transitions. [2024-10-11 03:41:50,504 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 10659 transitions. Word has length 70 [2024-10-11 03:41:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:50,504 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 10659 transitions. [2024-10-11 03:41:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 10659 transitions. [2024-10-11 03:41:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:41:50,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:50,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:50,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:41:50,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1770122057, now seen corresponding path program 1 times [2024-10-11 03:41:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637428894] [2024-10-11 03:41:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:50,620 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:41:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637428894] [2024-10-11 03:41:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637428894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059008635] [2024-10-11 03:41:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:50,622 INFO L87 Difference]: Start difference. First operand 7965 states and 10659 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:50,778 INFO L93 Difference]: Finished difference Result 12720 states and 17345 transitions. [2024-10-11 03:41:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 03:41:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:50,789 INFO L225 Difference]: With dead ends: 12720 [2024-10-11 03:41:50,789 INFO L226 Difference]: Without dead ends: 7620 [2024-10-11 03:41:50,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:50,794 INFO L432 NwaCegarLoop]: 1592 mSDtfsCounter, 1570 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:50,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 2091 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2024-10-11 03:41:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7612. [2024-10-11 03:41:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7612 states, 7605 states have (on average 1.3609467455621302) internal successors, (10350), 7611 states have internal predecessors, (10350), 0 states have call successors, (0), 0 states 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:41:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7612 states to 7612 states and 10350 transitions. [2024-10-11 03:41:50,858 INFO L78 Accepts]: Start accepts. Automaton has 7612 states and 10350 transitions. Word has length 70 [2024-10-11 03:41:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:50,858 INFO L471 AbstractCegarLoop]: Abstraction has 7612 states and 10350 transitions. [2024-10-11 03:41:50,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7612 states and 10350 transitions. [2024-10-11 03:41:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:41:50,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:50,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:50,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:41:50,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:50,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 546797367, now seen corresponding path program 1 times [2024-10-11 03:41:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289098901] [2024-10-11 03:41:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:50,972 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:41:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289098901] [2024-10-11 03:41:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289098901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719667526] [2024-10-11 03:41:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:50,975 INFO L87 Difference]: Start difference. First operand 7612 states and 10350 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:51,113 INFO L93 Difference]: Finished difference Result 15774 states and 21996 transitions. [2024-10-11 03:41:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:41:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:51,127 INFO L225 Difference]: With dead ends: 15774 [2024-10-11 03:41:51,127 INFO L226 Difference]: Without dead ends: 11771 [2024-10-11 03:41:51,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:51,133 INFO L432 NwaCegarLoop]: 1763 mSDtfsCounter, 1070 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:51,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 3063 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2024-10-11 03:41:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11763. [2024-10-11 03:41:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11763 states, 11756 states have (on average 1.3700238176250426) internal successors, (16106), 11762 states have internal predecessors, (16106), 0 states have call successors, (0), 0 states 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:41:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11763 states to 11763 states and 16106 transitions. [2024-10-11 03:41:51,248 INFO L78 Accepts]: Start accepts. Automaton has 11763 states and 16106 transitions. Word has length 71 [2024-10-11 03:41:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 11763 states and 16106 transitions. [2024-10-11 03:41:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11763 states and 16106 transitions. [2024-10-11 03:41:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:41:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:51,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:41:51,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:51,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1939459057, now seen corresponding path program 1 times [2024-10-11 03:41:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456578379] [2024-10-11 03:41:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:51,358 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:41:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456578379] [2024-10-11 03:41:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456578379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037211050] [2024-10-11 03:41:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:51,361 INFO L87 Difference]: Start difference. First operand 11763 states and 16106 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:51,458 INFO L93 Difference]: Finished difference Result 20289 states and 28899 transitions. [2024-10-11 03:41:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:41:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:51,475 INFO L225 Difference]: With dead ends: 20289 [2024-10-11 03:41:51,475 INFO L226 Difference]: Without dead ends: 13864 [2024-10-11 03:41:51,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:51,484 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 981 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:51,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 2399 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2024-10-11 03:41:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 11154. [2024-10-11 03:41:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11154 states, 11147 states have (on average 1.3957118507221673) internal successors, (15558), 11153 states have internal predecessors, (15558), 0 states have call successors, (0), 0 states 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:41:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11154 states to 11154 states and 15558 transitions. [2024-10-11 03:41:51,613 INFO L78 Accepts]: Start accepts. Automaton has 11154 states and 15558 transitions. Word has length 71 [2024-10-11 03:41:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:51,613 INFO L471 AbstractCegarLoop]: Abstraction has 11154 states and 15558 transitions. [2024-10-11 03:41:51,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11154 states and 15558 transitions. [2024-10-11 03:41:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:41:51,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:51,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:51,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:41:51,618 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:51,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1009351057, now seen corresponding path program 1 times [2024-10-11 03:41:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991550673] [2024-10-11 03:41:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:51,710 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:41:51,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991550673] [2024-10-11 03:41:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991550673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588314779] [2024-10-11 03:41:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:51,713 INFO L87 Difference]: Start difference. First operand 11154 states and 15558 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:51,930 INFO L93 Difference]: Finished difference Result 26445 states and 37499 transitions. [2024-10-11 03:41:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:41:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:51,958 INFO L225 Difference]: With dead ends: 26445 [2024-10-11 03:41:51,958 INFO L226 Difference]: Without dead ends: 18302 [2024-10-11 03:41:51,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:51,974 INFO L432 NwaCegarLoop]: 1833 mSDtfsCounter, 905 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:51,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 3091 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18302 states. [2024-10-11 03:41:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18302 to 18294. [2024-10-11 03:41:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18294 states, 18287 states have (on average 1.3870509104828568) internal successors, (25365), 18293 states have internal predecessors, (25365), 0 states have call successors, (0), 0 states 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:41:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18294 states to 18294 states and 25365 transitions. [2024-10-11 03:41:52,203 INFO L78 Accepts]: Start accepts. Automaton has 18294 states and 25365 transitions. Word has length 71 [2024-10-11 03:41:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:52,203 INFO L471 AbstractCegarLoop]: Abstraction has 18294 states and 25365 transitions. [2024-10-11 03:41:52,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18294 states and 25365 transitions. [2024-10-11 03:41:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:41:52,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:52,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:52,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:41:52,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:52,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1569860402, now seen corresponding path program 1 times [2024-10-11 03:41:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335974793] [2024-10-11 03:41:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:52,295 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:41:52,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335974793] [2024-10-11 03:41:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335974793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:52,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:52,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642433354] [2024-10-11 03:41:52,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:52,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:52,296 INFO L87 Difference]: Start difference. First operand 18294 states and 25365 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:52,515 INFO L93 Difference]: Finished difference Result 36106 states and 50825 transitions. [2024-10-11 03:41:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:52,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-11 03:41:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:52,538 INFO L225 Difference]: With dead ends: 36106 [2024-10-11 03:41:52,539 INFO L226 Difference]: Without dead ends: 19692 [2024-10-11 03:41:52,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:52,555 INFO L432 NwaCegarLoop]: 1426 mSDtfsCounter, 1155 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:52,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2026 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19692 states. [2024-10-11 03:41:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19692 to 16173. [2024-10-11 03:41:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16173 states, 16166 states have (on average 1.4033156006433254) internal successors, (22686), 16172 states have internal predecessors, (22686), 0 states have call successors, (0), 0 states 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:41:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16173 states to 16173 states and 22686 transitions. [2024-10-11 03:41:52,725 INFO L78 Accepts]: Start accepts. Automaton has 16173 states and 22686 transitions. Word has length 72 [2024-10-11 03:41:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 16173 states and 22686 transitions. [2024-10-11 03:41:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 16173 states and 22686 transitions. [2024-10-11 03:41:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:41:52,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:52,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:52,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:41:52,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-11 03:41:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -620993132, now seen corresponding path program 1 times [2024-10-11 03:41:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943211050] [2024-10-11 03:41:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:53,105 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:41:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943211050] [2024-10-11 03:41:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943211050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:41:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834597139] [2024-10-11 03:41:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:41:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:41:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:41:53,107 INFO L87 Difference]: Start difference. First operand 16173 states and 22686 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)