./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU --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 72aca9735a0330ad4ed4e9de4f21904354ce62c742d488d0b09ce6da875c2798 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:45,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:45,758 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:06:45,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:45,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:45,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:45,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:45,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:45,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:45,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:45,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:45,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:45,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:45,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:45,801 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:45,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:45,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:45,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:45,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:45,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:45,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:45,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:45,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:45,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:45,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:45,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:45,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:45,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:45,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:45,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:45,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:45,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:45,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:45,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:45,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:45,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:45,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:45,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:45,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:45,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:45,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:45,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:45,821 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 72aca9735a0330ad4ed4e9de4f21904354ce62c742d488d0b09ce6da875c2798 [2024-10-31 22:06:46,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:46,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:46,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:46,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:46,287 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:46,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c Unable to find full path for "g++" [2024-10-31 22:06:48,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:48,901 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:48,904 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-31 22:06:48,938 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/data/860679e28/2a7830f5a09c4a66b87254c4d9f439fc/FLAGfbcbc1937 [2024-10-31 22:06:48,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/data/860679e28/2a7830f5a09c4a66b87254c4d9f439fc [2024-10-31 22:06:48,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:48,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:48,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:48,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:48,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:48,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c443bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48, skipping insertion in model container [2024-10-31 22:06:48,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:49,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:49,477 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8448,8461] [2024-10-31 22:06:49,519 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12616,12629] [2024-10-31 22:06:49,612 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20366,20379] [2024-10-31 22:06:49,662 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27098,27111] [2024-10-31 22:06:49,834 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[47963,47976] [2024-10-31 22:06:50,008 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[73065,73078] [2024-10-31 22:06:50,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:50,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:50,328 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8448,8461] [2024-10-31 22:06:50,343 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12616,12629] [2024-10-31 22:06:50,366 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20366,20379] [2024-10-31 22:06:50,387 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27098,27111] [2024-10-31 22:06:50,442 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[47963,47976] [2024-10-31 22:06:50,501 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[73065,73078] [2024-10-31 22:06:50,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:50,710 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:50,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50 WrapperNode [2024-10-31 22:06:50,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:50,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:50,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:50,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:50,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,889 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6152 [2024-10-31 22:06:50,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:50,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:50,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:50,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:50,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,999 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-31 22:06:50,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:50,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:51,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:51,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:51,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:51,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (1/1) ... [2024-10-31 22:06:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:51,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:51,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a531629-2666-45d9-9316-5e9b0715acc0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:06:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:51,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:51,538 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:51,540 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:55,550 INFO L? ?]: Removed 1224 outVars from TransFormulas that were not future-live. [2024-10-31 22:06:55,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:55,596 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:55,596 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:06:55,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:55 BoogieIcfgContainer [2024-10-31 22:06:55,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:55,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:55,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:55,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:55,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:48" (1/3) ... [2024-10-31 22:06:55,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575c0adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:55, skipping insertion in model container [2024-10-31 22:06:55,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:50" (2/3) ... [2024-10-31 22:06:55,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575c0adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:55, skipping insertion in model container [2024-10-31 22:06:55,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:55" (3/3) ... [2024-10-31 22:06:55,611 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-31 22:06:55,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:55,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-31 22:06:55,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:55,761 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;@58441cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:55,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:06:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 1190 states, 1183 states have (on average 1.7861369399830938) internal successors, (2113), 1189 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 22:06:55,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:55,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:55,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:06:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 46255632, now seen corresponding path program 1 times [2024-10-31 22:06:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906032055] [2024-10-31 22:06:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:56,510 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-31 22:06:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906032055] [2024-10-31 22:06:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906032055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:56,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004224211] [2024-10-31 22:06:56,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:56,558 INFO L87 Difference]: Start difference. First operand has 1190 states, 1183 states have (on average 1.7861369399830938) internal successors, (2113), 1189 states have internal predecessors, (2113), 0 states have call successors, (0), 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 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:58,613 INFO L93 Difference]: Finished difference Result 2203 states and 3804 transitions. [2024-10-31 22:06:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-31 22:06:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:58,642 INFO L225 Difference]: With dead ends: 2203 [2024-10-31 22:06:58,643 INFO L226 Difference]: Without dead ends: 1434 [2024-10-31 22:06:58,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:58,661 INFO L432 NwaCegarLoop]: 1143 mSDtfsCounter, 6730 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6730 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:58,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6730 Valid, 1533 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-31 22:06:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-10-31 22:06:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1420. [2024-10-31 22:06:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1414 states have (on average 1.2998585572842998) internal successors, (1838), 1419 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1838 transitions. [2024-10-31 22:06:58,843 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1838 transitions. Word has length 52 [2024-10-31 22:06:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:58,844 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 1838 transitions. [2024-10-31 22:06:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1838 transitions. [2024-10-31 22:06:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 22:06:58,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:58,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:58,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:06:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -625695834, now seen corresponding path program 1 times [2024-10-31 22:06:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589143755] [2024-10-31 22:06:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:59,268 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-31 22:06:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589143755] [2024-10-31 22:06:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589143755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:59,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553097247] [2024-10-31 22:06:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:59,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:59,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:59,274 INFO L87 Difference]: Start difference. First operand 1420 states and 1838 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:00,566 INFO L93 Difference]: Finished difference Result 2665 states and 3516 transitions. [2024-10-31 22:07:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:07:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-31 22:07:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:00,573 INFO L225 Difference]: With dead ends: 2665 [2024-10-31 22:07:00,573 INFO L226 Difference]: Without dead ends: 1806 [2024-10-31 22:07:00,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:07:00,578 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 4443 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:00,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 902 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 22:07:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-10-31 22:07:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1796. [2024-10-31 22:07:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1790 states have (on average 1.318435754189944) internal successors, (2360), 1795 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2360 transitions. [2024-10-31 22:07:00,629 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2360 transitions. Word has length 52 [2024-10-31 22:07:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2360 transitions. [2024-10-31 22:07:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2360 transitions. [2024-10-31 22:07:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 22:07:00,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:00,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:07:00,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1958316630, now seen corresponding path program 1 times [2024-10-31 22:07:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424328094] [2024-10-31 22:07:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:00,858 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-31 22:07:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:00,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424328094] [2024-10-31 22:07:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424328094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:00,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:07:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242795573] [2024-10-31 22:07:00,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:00,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:07:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:07:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:07:00,862 INFO L87 Difference]: Start difference. First operand 1796 states and 2360 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:02,028 INFO L93 Difference]: Finished difference Result 3577 states and 4761 transitions. [2024-10-31 22:07:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:07:02,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-31 22:07:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:02,039 INFO L225 Difference]: With dead ends: 3577 [2024-10-31 22:07:02,039 INFO L226 Difference]: Without dead ends: 2639 [2024-10-31 22:07:02,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:07:02,043 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 4016 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4016 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:02,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4016 Valid, 859 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:07:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2024-10-31 22:07:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2633. [2024-10-31 22:07:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2627 states have (on average 1.3113818043395509) internal successors, (3445), 2632 states have internal predecessors, (3445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3445 transitions. [2024-10-31 22:07:02,119 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3445 transitions. Word has length 52 [2024-10-31 22:07:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:02,119 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3445 transitions. [2024-10-31 22:07:02,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3445 transitions. [2024-10-31 22:07:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 22:07:02,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:02,123 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] [2024-10-31 22:07:02,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:07:02,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1639759782, now seen corresponding path program 1 times [2024-10-31 22:07:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088122830] [2024-10-31 22:07:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:02,673 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-31 22:07:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088122830] [2024-10-31 22:07:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088122830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:07:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118977806] [2024-10-31 22:07:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:07:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:07:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:07:02,680 INFO L87 Difference]: Start difference. First operand 2633 states and 3445 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:05,074 INFO L93 Difference]: Finished difference Result 4764 states and 6444 transitions. [2024-10-31 22:07:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:07:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-31 22:07:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:05,087 INFO L225 Difference]: With dead ends: 4764 [2024-10-31 22:07:05,087 INFO L226 Difference]: Without dead ends: 4236 [2024-10-31 22:07:05,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-10-31 22:07:05,090 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 5930 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5930 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:05,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5930 Valid, 2668 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-31 22:07:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2024-10-31 22:07:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2633. [2024-10-31 22:07:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2627 states have (on average 1.3110011419870575) internal successors, (3444), 2632 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3444 transitions. [2024-10-31 22:07:05,174 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3444 transitions. Word has length 54 [2024-10-31 22:07:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:05,174 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3444 transitions. [2024-10-31 22:07:05,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3444 transitions. [2024-10-31 22:07:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 22:07:05,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:05,177 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] [2024-10-31 22:07:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:07:05,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1969154310, now seen corresponding path program 1 times [2024-10-31 22:07:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183402762] [2024-10-31 22:07:05,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,623 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-31 22:07:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183402762] [2024-10-31 22:07:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183402762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:05,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:07:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235795381] [2024-10-31 22:07:05,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:05,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:07:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:05,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:07:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:07:05,626 INFO L87 Difference]: Start difference. First operand 2633 states and 3444 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:08,420 INFO L93 Difference]: Finished difference Result 4374 states and 5881 transitions. [2024-10-31 22:07:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:07:08,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-31 22:07:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:08,437 INFO L225 Difference]: With dead ends: 4374 [2024-10-31 22:07:08,437 INFO L226 Difference]: Without dead ends: 4368 [2024-10-31 22:07:08,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-10-31 22:07:08,442 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 3826 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3826 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:08,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3826 Valid, 3429 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-31 22:07:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2024-10-31 22:07:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 2633. [2024-10-31 22:07:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2627 states have (on average 1.3106204796345642) internal successors, (3443), 2632 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3443 transitions. [2024-10-31 22:07:08,544 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3443 transitions. Word has length 54 [2024-10-31 22:07:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:08,545 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3443 transitions. [2024-10-31 22:07:08,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3443 transitions. [2024-10-31 22:07:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 22:07:08,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:08,549 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] [2024-10-31 22:07:08,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:07:08,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash -91421350, now seen corresponding path program 1 times [2024-10-31 22:07:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062404128] [2024-10-31 22:07:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:09,171 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-31 22:07:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062404128] [2024-10-31 22:07:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062404128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:07:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113198665] [2024-10-31 22:07:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:07:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:09,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:07:09,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:07:09,181 INFO L87 Difference]: Start difference. First operand 2633 states and 3443 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:10,759 INFO L93 Difference]: Finished difference Result 3900 states and 5218 transitions. [2024-10-31 22:07:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:07:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-31 22:07:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:10,769 INFO L225 Difference]: With dead ends: 3900 [2024-10-31 22:07:10,769 INFO L226 Difference]: Without dead ends: 3216 [2024-10-31 22:07:10,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:07:10,772 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 5274 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5274 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:10,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5274 Valid, 1904 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-31 22:07:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2024-10-31 22:07:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2633. [2024-10-31 22:07:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2627 states have (on average 1.3102398172820708) internal successors, (3442), 2632 states have internal predecessors, (3442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3442 transitions. [2024-10-31 22:07:10,835 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3442 transitions. Word has length 54 [2024-10-31 22:07:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:10,836 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3442 transitions. [2024-10-31 22:07:10,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3442 transitions. [2024-10-31 22:07:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 22:07:10,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:10,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:07:10,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:10,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash -217892301, now seen corresponding path program 1 times [2024-10-31 22:07:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:10,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361107115] [2024-10-31 22:07:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:10,940 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-31 22:07:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361107115] [2024-10-31 22:07:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361107115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202983096] [2024-10-31 22:07:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:10,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:10,943 INFO L87 Difference]: Start difference. First operand 2633 states and 3442 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:11,052 INFO L93 Difference]: Finished difference Result 3809 states and 5163 transitions. [2024-10-31 22:07:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-31 22:07:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:11,059 INFO L225 Difference]: With dead ends: 3809 [2024-10-31 22:07:11,059 INFO L226 Difference]: Without dead ends: 2398 [2024-10-31 22:07:11,061 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-31 22:07:11,062 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 632 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:11,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1366 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-10-31 22:07:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2396. [2024-10-31 22:07:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2390 states have (on average 1.3112970711297072) internal successors, (3134), 2395 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3134 transitions. [2024-10-31 22:07:11,108 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3134 transitions. Word has length 55 [2024-10-31 22:07:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:11,109 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3134 transitions. [2024-10-31 22:07:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3134 transitions. [2024-10-31 22:07:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 22:07:11,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:11,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:11,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:07:11,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:11,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1212692211, now seen corresponding path program 1 times [2024-10-31 22:07:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:11,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863850072] [2024-10-31 22:07:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:11,219 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-31 22:07:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863850072] [2024-10-31 22:07:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863850072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495813162] [2024-10-31 22:07:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:11,223 INFO L87 Difference]: Start difference. First operand 2396 states and 3134 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:11,319 INFO L93 Difference]: Finished difference Result 4034 states and 5593 transitions. [2024-10-31 22:07:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-31 22:07:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:11,330 INFO L225 Difference]: With dead ends: 4034 [2024-10-31 22:07:11,330 INFO L226 Difference]: Without dead ends: 2929 [2024-10-31 22:07:11,332 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-31 22:07:11,333 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 490 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:11,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1447 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2024-10-31 22:07:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2927. [2024-10-31 22:07:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2921 states have (on average 1.3543307086614174) internal successors, (3956), 2926 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3956 transitions. [2024-10-31 22:07:11,391 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3956 transitions. Word has length 55 [2024-10-31 22:07:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3956 transitions. [2024-10-31 22:07:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3956 transitions. [2024-10-31 22:07:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 22:07:11,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:11,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:11,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:07:11,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 508156110, now seen corresponding path program 1 times [2024-10-31 22:07:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710373845] [2024-10-31 22:07:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:11,485 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-31 22:07:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710373845] [2024-10-31 22:07:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710373845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:11,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630495502] [2024-10-31 22:07:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:11,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:11,487 INFO L87 Difference]: Start difference. First operand 2927 states and 3956 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:11,569 INFO L93 Difference]: Finished difference Result 5825 states and 8243 transitions. [2024-10-31 22:07:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-31 22:07:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:11,582 INFO L225 Difference]: With dead ends: 5825 [2024-10-31 22:07:11,582 INFO L226 Difference]: Without dead ends: 4034 [2024-10-31 22:07:11,585 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-31 22:07:11,585 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 448 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:11,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1480 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2024-10-31 22:07:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4032. [2024-10-31 22:07:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 4026 states have (on average 1.378787878787879) internal successors, (5551), 4031 states have internal predecessors, (5551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5551 transitions. [2024-10-31 22:07:11,671 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5551 transitions. Word has length 55 [2024-10-31 22:07:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:11,671 INFO L471 AbstractCegarLoop]: Abstraction has 4032 states and 5551 transitions. [2024-10-31 22:07:11,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5551 transitions. [2024-10-31 22:07:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-31 22:07:11,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:11,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:11,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:11,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1409707165, now seen corresponding path program 1 times [2024-10-31 22:07:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200124798] [2024-10-31 22:07:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:11,801 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-31 22:07:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200124798] [2024-10-31 22:07:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200124798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425693017] [2024-10-31 22:07:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:11,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:11,805 INFO L87 Difference]: Start difference. First operand 4032 states and 5551 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:11,989 INFO L93 Difference]: Finished difference Result 8005 states and 11199 transitions. [2024-10-31 22:07:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-31 22:07:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:12,013 INFO L225 Difference]: With dead ends: 8005 [2024-10-31 22:07:12,013 INFO L226 Difference]: Without dead ends: 4544 [2024-10-31 22:07:12,019 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-31 22:07:12,020 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 693 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:12,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1009 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2024-10-31 22:07:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 3633. [2024-10-31 22:07:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3628 states have (on average 1.3930540242557883) internal successors, (5054), 3632 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 5054 transitions. [2024-10-31 22:07:12,099 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 5054 transitions. Word has length 56 [2024-10-31 22:07:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 5054 transitions. [2024-10-31 22:07:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 5054 transitions. [2024-10-31 22:07:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-31 22:07:12,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:12,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:07:12,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-31 22:07:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1142157029, now seen corresponding path program 1 times [2024-10-31 22:07:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714244685] [2024-10-31 22:07:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:13,138 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-31 22:07:13,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714244685] [2024-10-31 22:07:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714244685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:07:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758562555] [2024-10-31 22:07:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:07:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:07:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:07:13,141 INFO L87 Difference]: Start difference. First operand 3633 states and 5054 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)