./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:28:04,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:28:04,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:28:04,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:28:04,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:28:04,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:28:04,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:28:04,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:28:04,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:28:04,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:28:04,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:28:04,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:28:04,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:28:04,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:28:04,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:28:04,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:28:04,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:28:04,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:28:04,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:28:04,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:28:04,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:28:04,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:28:04,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:28:04,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:28:04,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:28:04,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:28:04,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:28:04,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:28:04,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:28:04,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:28:04,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:28:04,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:28:04,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:28:04,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:28:04,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:28:04,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:28:04,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:28:04,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:28:04,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:28:04,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:28:04,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:28:04,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:28:04,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:28:04,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:28:04,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:28:04,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:28:04,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:28:04,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:28:04,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:28:04,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:28:04,312 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:28:04,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:28:04,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:28:04,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:28:04,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:28:04,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:28:04,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:28:04,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:28:04,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:28:04,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:28:04,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:28:04,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:28:04,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:28:04,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:28:04,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:28:04,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:28:04,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:04,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:28:04,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:28:04,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:28:04,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:28:04,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:28:04,325 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:28:04,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:28:04,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:28:04,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/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_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 [2022-11-02 20:28:04,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:28:04,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:28:04,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:28:04,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:28:04,736 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:28:04,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2022-11-02 20:28:04,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/data/30f66069f/f30bec0cc58f49a981460245fedeadc3/FLAGaff06be51 [2022-11-02 20:28:05,488 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:28:05,489 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2022-11-02 20:28:05,498 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/data/30f66069f/f30bec0cc58f49a981460245fedeadc3/FLAGaff06be51 [2022-11-02 20:28:05,821 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/data/30f66069f/f30bec0cc58f49a981460245fedeadc3 [2022-11-02 20:28:05,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:28:05,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:28:05,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:05,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:28:05,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:28:05,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:05" (1/1) ... [2022-11-02 20:28:05,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fb5056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:05, skipping insertion in model container [2022-11-02 20:28:05,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:05" (1/1) ... [2022-11-02 20:28:05,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:28:05,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:28:06,292 WARN L230 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_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-11-02 20:28:06,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:06,326 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:28:06,379 WARN L230 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_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-11-02 20:28:06,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:06,419 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:28:06,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06 WrapperNode [2022-11-02 20:28:06,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:06,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:06,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:28:06,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:28:06,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,511 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-11-02 20:28:06,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:06,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:28:06,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:28:06,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:28:06,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:28:06,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:28:06,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:28:06,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:28:06,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (1/1) ... [2022-11-02 20:28:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:06,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:28:06,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:28:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:28:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:28:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:28:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:28:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:28:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:28:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:28:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:28:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:28:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:28:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:28:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:28:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:28:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:28:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:28:06,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:28:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:28:06,718 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:28:06,939 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:28:06,957 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:28:07,472 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:28:07,754 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:28:07,754 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:28:07,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:07 BoogieIcfgContainer [2022-11-02 20:28:07,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:28:07,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:28:07,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:28:07,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:28:07,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:28:05" (1/3) ... [2022-11-02 20:28:07,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391714a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:07, skipping insertion in model container [2022-11-02 20:28:07,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:06" (2/3) ... [2022-11-02 20:28:07,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391714a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:07, skipping insertion in model container [2022-11-02 20:28:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:07" (3/3) ... [2022-11-02 20:28:07,783 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-11-02 20:28:07,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:28:07,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:28:07,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:28:07,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:28:07,984 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:28:08,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-11-02 20:28:08,203 INFO L130 PetriNetUnfolder]: 18/208 cut-off events. [2022-11-02 20:28:08,204 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:28:08,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2022-11-02 20:28:08,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 211 transitions, 446 flow [2022-11-02 20:28:08,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 197 transitions, 412 flow [2022-11-02 20:28:08,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:28:08,270 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2137f538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:28:08,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:28:08,376 INFO L130 PetriNetUnfolder]: 18/196 cut-off events. [2022-11-02 20:28:08,377 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:28:08,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:08,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:08,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1505487722, now seen corresponding path program 1 times [2022-11-02 20:28:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375233572] [2022-11-02 20:28:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375233572] [2022-11-02 20:28:08,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375233572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:08,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:08,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88953542] [2022-11-02 20:28:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:08,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:28:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:28:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:28:08,911 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 211 [2022-11-02 20:28:08,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 197 transitions, 412 flow. Second operand has 2 states, 2 states have (on average 191.0) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:08,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 211 [2022-11-02 20:28:08,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:09,090 INFO L130 PetriNetUnfolder]: 71/370 cut-off events. [2022-11-02 20:28:09,092 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-02 20:28:09,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 370 events. 71/370 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1031 event pairs, 38 based on Foata normal form. 60/393 useless extension candidates. Maximal degree in co-relation 331. Up to 106 conditions per place. [2022-11-02 20:28:09,102 INFO L137 encePairwiseOnDemand]: 198/211 looper letters, 11 selfloop transitions, 0 changer transitions 6/184 dead transitions. [2022-11-02 20:28:09,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 184 transitions, 408 flow [2022-11-02 20:28:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:28:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:28:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 396 transitions. [2022-11-02 20:28:09,133 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9383886255924171 [2022-11-02 20:28:09,135 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 396 transitions. [2022-11-02 20:28:09,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 396 transitions. [2022-11-02 20:28:09,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:09,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 396 transitions. [2022-11-02 20:28:09,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,166 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,168 INFO L175 Difference]: Start difference. First operand has 189 places, 197 transitions, 412 flow. Second operand 2 states and 396 transitions. [2022-11-02 20:28:09,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 184 transitions, 408 flow [2022-11-02 20:28:09,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 184 transitions, 396 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:28:09,188 INFO L231 Difference]: Finished difference. Result has 184 places, 178 transitions, 362 flow [2022-11-02 20:28:09,191 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=362, PETRI_PLACES=184, PETRI_TRANSITIONS=178} [2022-11-02 20:28:09,198 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -5 predicate places. [2022-11-02 20:28:09,198 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 178 transitions, 362 flow [2022-11-02 20:28:09,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 191.0) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:09,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:09,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:28:09,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1135271026, now seen corresponding path program 1 times [2022-11-02 20:28:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:09,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544232320] [2022-11-02 20:28:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:10,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544232320] [2022-11-02 20:28:10,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544232320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:10,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:10,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:28:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108861704] [2022-11-02 20:28:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:10,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:10,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:10,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:10,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:10,017 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 211 [2022-11-02 20:28:10,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 178 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:10,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 211 [2022-11-02 20:28:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:10,383 INFO L130 PetriNetUnfolder]: 73/454 cut-off events. [2022-11-02 20:28:10,384 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:28:10,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 454 events. 73/454 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1289 event pairs, 38 based on Foata normal form. 11/430 useless extension candidates. Maximal degree in co-relation 622. Up to 118 conditions per place. [2022-11-02 20:28:10,389 INFO L137 encePairwiseOnDemand]: 199/211 looper letters, 33 selfloop transitions, 8 changer transitions 17/199 dead transitions. [2022-11-02 20:28:10,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 199 transitions, 523 flow [2022-11-02 20:28:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:28:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:28:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1501 transitions. [2022-11-02 20:28:10,396 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7904160084254871 [2022-11-02 20:28:10,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1501 transitions. [2022-11-02 20:28:10,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1501 transitions. [2022-11-02 20:28:10,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:10,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1501 transitions. [2022-11-02 20:28:10,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.77777777777777) internal successors, (1501), 9 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,412 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,412 INFO L175 Difference]: Start difference. First operand has 184 places, 178 transitions, 362 flow. Second operand 9 states and 1501 transitions. [2022-11-02 20:28:10,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 199 transitions, 523 flow [2022-11-02 20:28:10,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 199 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:28:10,422 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 394 flow [2022-11-02 20:28:10,423 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2022-11-02 20:28:10,424 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-11-02 20:28:10,425 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 394 flow [2022-11-02 20:28:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:10,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:10,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:28:10,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -962340754, now seen corresponding path program 1 times [2022-11-02 20:28:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:10,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772834114] [2022-11-02 20:28:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:28:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772834114] [2022-11-02 20:28:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772834114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:10,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:10,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:28:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898423035] [2022-11-02 20:28:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:10,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:10,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:10,901 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 211 [2022-11-02 20:28:10,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:10,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 211 [2022-11-02 20:28:10,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:11,214 INFO L130 PetriNetUnfolder]: 92/479 cut-off events. [2022-11-02 20:28:11,214 INFO L131 PetriNetUnfolder]: For 83/95 co-relation queries the response was YES. [2022-11-02 20:28:11,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 479 events. 92/479 cut-off events. For 83/95 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1563 event pairs, 50 based on Foata normal form. 15/452 useless extension candidates. Maximal degree in co-relation 775. Up to 115 conditions per place. [2022-11-02 20:28:11,219 INFO L137 encePairwiseOnDemand]: 202/211 looper letters, 36 selfloop transitions, 6 changer transitions 8/191 dead transitions. [2022-11-02 20:28:11,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 191 transitions, 528 flow [2022-11-02 20:28:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:28:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:28:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1171 transitions. [2022-11-02 20:28:11,225 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7928232904536222 [2022-11-02 20:28:11,225 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1171 transitions. [2022-11-02 20:28:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1171 transitions. [2022-11-02 20:28:11,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:11,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1171 transitions. [2022-11-02 20:28:11,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.28571428571428) internal successors, (1171), 7 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,236 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,236 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 394 flow. Second operand 7 states and 1171 transitions. [2022-11-02 20:28:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 191 transitions, 528 flow [2022-11-02 20:28:11,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 514 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:28:11,247 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 404 flow [2022-11-02 20:28:11,248 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2022-11-02 20:28:11,251 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 0 predicate places. [2022-11-02 20:28:11,251 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 404 flow [2022-11-02 20:28:11,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:11,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:11,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:28:11,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1575868577, now seen corresponding path program 1 times [2022-11-02 20:28:11,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:11,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728577329] [2022-11-02 20:28:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:28:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:11,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728577329] [2022-11-02 20:28:11,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728577329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:11,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:11,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12326452] [2022-11-02 20:28:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:11,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:11,819 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2022-11-02 20:28:11,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:11,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2022-11-02 20:28:11,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:12,011 INFO L130 PetriNetUnfolder]: 82/405 cut-off events. [2022-11-02 20:28:12,011 INFO L131 PetriNetUnfolder]: For 87/91 co-relation queries the response was YES. [2022-11-02 20:28:12,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 405 events. 82/405 cut-off events. For 87/91 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1110 event pairs, 23 based on Foata normal form. 8/390 useless extension candidates. Maximal degree in co-relation 647. Up to 81 conditions per place. [2022-11-02 20:28:12,016 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 20 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2022-11-02 20:28:12,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 186 transitions, 474 flow [2022-11-02 20:28:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:28:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 741 transitions. [2022-11-02 20:28:12,021 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8779620853080569 [2022-11-02 20:28:12,021 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 741 transitions. [2022-11-02 20:28:12,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 741 transitions. [2022-11-02 20:28:12,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:12,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 741 transitions. [2022-11-02 20:28:12,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,029 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 404 flow. Second operand 4 states and 741 transitions. [2022-11-02 20:28:12,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 186 transitions, 474 flow [2022-11-02 20:28:12,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 186 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:28:12,035 INFO L231 Difference]: Finished difference. Result has 188 places, 181 transitions, 412 flow [2022-11-02 20:28:12,036 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=188, PETRI_TRANSITIONS=181} [2022-11-02 20:28:12,037 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-11-02 20:28:12,038 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 412 flow [2022-11-02 20:28:12,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:12,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:12,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:28:12,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -953166579, now seen corresponding path program 2 times [2022-11-02 20:28:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:12,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789877037] [2022-11-02 20:28:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:28:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:12,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789877037] [2022-11-02 20:28:12,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789877037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:12,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:12,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058079347] [2022-11-02 20:28:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:12,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:12,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:12,434 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 211 [2022-11-02 20:28:12,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:12,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 211 [2022-11-02 20:28:12,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:12,563 INFO L130 PetriNetUnfolder]: 58/357 cut-off events. [2022-11-02 20:28:12,563 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-11-02 20:28:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 357 events. 58/357 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 838 event pairs, 15 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 576. Up to 91 conditions per place. [2022-11-02 20:28:12,567 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 17 selfloop transitions, 3 changer transitions 0/185 dead transitions. [2022-11-02 20:28:12,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 185 transitions, 466 flow [2022-11-02 20:28:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2022-11-02 20:28:12,570 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8941548183254344 [2022-11-02 20:28:12,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2022-11-02 20:28:12,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2022-11-02 20:28:12,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:12,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2022-11-02 20:28:12,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,576 INFO L175 Difference]: Start difference. First operand has 188 places, 181 transitions, 412 flow. Second operand 3 states and 566 transitions. [2022-11-02 20:28:12,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 185 transitions, 466 flow [2022-11-02 20:28:12,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 185 transitions, 454 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-02 20:28:12,583 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 423 flow [2022-11-02 20:28:12,583 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2022-11-02 20:28:12,584 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-11-02 20:28:12,584 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 423 flow [2022-11-02 20:28:12,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:12,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:12,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:28:12,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1907548187, now seen corresponding path program 3 times [2022-11-02 20:28:12,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:12,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241858860] [2022-11-02 20:28:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:23,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:23,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241858860] [2022-11-02 20:28:23,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241858860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:23,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705591710] [2022-11-02 20:28:23,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:28:23,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:23,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:23,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:23,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:28:23,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-02 20:28:23,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:23,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:28:23,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:26,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:28:27,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:27,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:28:29,820 INFO L356 Elim1Store]: treesize reduction 32, result has 39.6 percent of original size [2022-11-02 20:28:29,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 37 [2022-11-02 20:28:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:28:30,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:28:30,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705591710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:30,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:28:30,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [42] total 56 [2022-11-02 20:28:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965432565] [2022-11-02 20:28:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:30,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:28:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:28:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2894, Unknown=1, NotChecked=0, Total=3080 [2022-11-02 20:28:30,091 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2022-11-02 20:28:30,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 423 flow. Second operand has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:30,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2022-11-02 20:28:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:30,757 INFO L130 PetriNetUnfolder]: 724/1549 cut-off events. [2022-11-02 20:28:30,758 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2022-11-02 20:28:30,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3454 conditions, 1549 events. 724/1549 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7635 event pairs, 185 based on Foata normal form. 1/1411 useless extension candidates. Maximal degree in co-relation 3445. Up to 904 conditions per place. [2022-11-02 20:28:30,772 INFO L137 encePairwiseOnDemand]: 182/211 looper letters, 103 selfloop transitions, 49 changer transitions 4/249 dead transitions. [2022-11-02 20:28:30,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 920 flow [2022-11-02 20:28:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:28:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-02 20:28:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2454 transitions. [2022-11-02 20:28:30,780 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5056665979806305 [2022-11-02 20:28:30,780 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2454 transitions. [2022-11-02 20:28:30,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2454 transitions. [2022-11-02 20:28:30,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:30,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2454 transitions. [2022-11-02 20:28:30,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 106.69565217391305) internal successors, (2454), 23 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 211.0) internal successors, (5064), 24 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,801 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 211.0) internal successors, (5064), 24 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,801 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 423 flow. Second operand 23 states and 2454 transitions. [2022-11-02 20:28:30,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 920 flow [2022-11-02 20:28:30,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 249 transitions, 915 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:30,810 INFO L231 Difference]: Finished difference. Result has 217 places, 226 transitions, 737 flow [2022-11-02 20:28:30,810 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=737, PETRI_PLACES=217, PETRI_TRANSITIONS=226} [2022-11-02 20:28:30,811 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 28 predicate places. [2022-11-02 20:28:30,812 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 226 transitions, 737 flow [2022-11-02 20:28:30,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:30,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:30,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:31,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:28:31,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:28:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1348670141, now seen corresponding path program 4 times [2022-11-02 20:28:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:31,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923486690] [2022-11-02 20:28:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923486690] [2022-11-02 20:28:39,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923486690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663044250] [2022-11-02 20:28:39,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:28:39,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:39,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:39,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:39,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:28:39,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:28:39,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:39,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:28:39,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:44,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:28:44,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:44,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:28:45,316 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-02 20:28:45,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-11-02 20:28:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:28:45,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:47,792 INFO L356 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-11-02 20:28:47,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1088 treesize of output 1040 [2022-11-02 20:28:47,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:47,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 940 treesize of output 780 [2022-11-02 20:28:47,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:47,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 736 treesize of output 678 [2022-11-02 20:29:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:29:13,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663044250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:13,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:29:13,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 34, 30] total 90 [2022-11-02 20:29:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407720423] [2022-11-02 20:29:13,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-02 20:29:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-02 20:29:13,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=7538, Unknown=5, NotChecked=0, Total=8010 [2022-11-02 20:29:13,147 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 211 [2022-11-02 20:29:13,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 226 transitions, 737 flow. Second operand has 90 states, 90 states have (on average 82.07777777777778) internal successors, (7387), 90 states have internal predecessors, (7387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:13,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:13,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 211 [2022-11-02 20:29:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:39,782 INFO L130 PetriNetUnfolder]: 2024/4398 cut-off events. [2022-11-02 20:29:39,782 INFO L131 PetriNetUnfolder]: For 4849/4887 co-relation queries the response was YES. [2022-11-02 20:29:39,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11771 conditions, 4398 events. 2024/4398 cut-off events. For 4849/4887 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 30170 event pairs, 249 based on Foata normal form. 26/4087 useless extension candidates. Maximal degree in co-relation 11754. Up to 1188 conditions per place. [2022-11-02 20:29:39,827 INFO L137 encePairwiseOnDemand]: 151/211 looper letters, 378 selfloop transitions, 234 changer transitions 9/691 dead transitions. [2022-11-02 20:29:39,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 691 transitions, 3889 flow [2022-11-02 20:29:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-02 20:29:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-11-02 20:29:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 8360 transitions. [2022-11-02 20:29:39,856 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4002106371774618 [2022-11-02 20:29:39,857 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 8360 transitions. [2022-11-02 20:29:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 8360 transitions. [2022-11-02 20:29:39,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:39,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 8360 transitions. [2022-11-02 20:29:39,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 84.44444444444444) internal successors, (8360), 99 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 211.0) internal successors, (21100), 100 states have internal predecessors, (21100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,945 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 211.0) internal successors, (21100), 100 states have internal predecessors, (21100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,955 INFO L175 Difference]: Start difference. First operand has 217 places, 226 transitions, 737 flow. Second operand 99 states and 8360 transitions. [2022-11-02 20:29:39,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 691 transitions, 3889 flow [2022-11-02 20:29:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 691 transitions, 3770 flow, removed 47 selfloop flow, removed 12 redundant places. [2022-11-02 20:29:40,002 INFO L231 Difference]: Finished difference. Result has 336 places, 438 transitions, 2577 flow [2022-11-02 20:29:40,003 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2577, PETRI_PLACES=336, PETRI_TRANSITIONS=438} [2022-11-02 20:29:40,004 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 147 predicate places. [2022-11-02 20:29:40,005 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 438 transitions, 2577 flow [2022-11-02 20:29:40,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 82.07777777777778) internal successors, (7387), 90 states have internal predecessors, (7387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:40,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:40,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:40,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:40,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:40,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:29:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1500769233, now seen corresponding path program 5 times [2022-11-02 20:29:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286339648] [2022-11-02 20:29:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:40,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:49,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286339648] [2022-11-02 20:29:49,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286339648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:49,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831596439] [2022-11-02 20:29:49,376 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:29:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:49,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:49,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1d14fb-9e1b-48f4-9e8a-f1508ca16326/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:29:49,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:29:49,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:29:49,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-02 20:29:49,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:49,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:29:49,757 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:29:49,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:29:51,131 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:29:51,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:29:51,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:29:54,509 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-11-02 20:29:54,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-11-02 20:29:55,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:29:57,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:29:57,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:29:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:58,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:30:00,043 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-02 20:30:00,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2022-11-02 20:30:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:00,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:02,100 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (* c_~t~0 2)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse5 ~q2~0.base))) (let ((.cse3 (select .cse1 .cse7))) (let ((.cse4 (+ .cse3 1))) (or (< (+ .cse0 (* (select .cse1 .cse2) 2)) (+ c_~s~0 .cse3)) (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) .cse6) .cse4)))))))) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse10 (select .cse11 ~q2~0.base))) (let ((.cse9 (select .cse10 .cse7))) (let ((.cse8 (+ .cse9 1))) (or (not (<= .cse8 0)) (<= (+ c_~s~0 .cse9) (+ .cse0 (* (select .cse10 .cse2) 2) 1)) (not (<= (select (select .cse11 c_~q1~0.base) .cse6) .cse8)))))))))) (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-02 20:30:02,357 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~q2_back~0 c_~n2~0)) (let ((.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (* c_~t~0 2)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse4 (select .cse0 ~q2~0.base))) (let ((.cse6 (select .cse4 .cse7))) (let ((.cse2 (+ .cse6 1))) (or (not (<= (select (select .cse0 c_~q1~0.base) .cse1) .cse2)) (< (+ .cse3 (* (select .cse4 .cse5) 2)) (+ c_~s~0 .cse6)) (not (<= .cse2 0)))))))) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse11 (select .cse8 ~q2~0.base))) (let ((.cse10 (select .cse11 .cse7))) (let ((.cse9 (+ .cse10 1))) (or (not (<= (select (select .cse8 c_~q1~0.base) .cse1) .cse9)) (<= (+ c_~s~0 .cse10) (+ .cse3 (* (select .cse11 .cse5) 2) 1)) (not (<= .cse9 0)))))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-02 20:30:02,433 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (* c_~t~0 2)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse4 (select .cse0 ~q2~0.base))) (let ((.cse6 (select .cse4 .cse7))) (let ((.cse2 (+ .cse6 1))) (or (not (<= (select (select .cse0 c_~q1~0.base) .cse1) .cse2)) (< (+ .cse3 (* (select .cse4 .cse5) 2)) (+ c_~s~0 .cse6)) (not (<= .cse2 0)))))))) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse11 (select .cse8 ~q2~0.base))) (let ((.cse10 (select .cse11 .cse7))) (let ((.cse9 (+ .cse10 1))) (or (not (<= (select (select .cse8 c_~q1~0.base) .cse1) .cse9)) (<= (+ c_~s~0 .cse10) (+ .cse3 (* (select .cse11 .cse5) 2) 1)) (not (<= .cse9 0)))))))))) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-02 20:30:03,008 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (* c_~t~0 2)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (not (= (select (select .cse0 c_~q1~0.base) .cse1) 0)) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse6 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse3 (select .cse6 ~q2~0.base))) (let ((.cse5 (select .cse3 .cse9))) (let ((.cse8 (+ .cse5 1))) (or (< (+ .cse2 (* (select .cse3 .cse4) 2)) (+ c_~s~0 .cse5)) (not (<= (select (select .cse6 c_~q1~0.base) .cse7) .cse8)) (not (<= .cse8 0))))))))))) (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (not (= (select (select .cse10 c_~q1~0.base) .cse1) 0)) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse11 (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse14 (select .cse11 ~q2~0.base))) (let ((.cse13 (select .cse14 .cse9))) (let ((.cse12 (+ .cse13 1))) (or (not (<= (select (select .cse11 c_~q1~0.base) .cse7) .cse12)) (<= (+ c_~s~0 .cse13) (+ .cse2 (* (select .cse14 .cse4) 2) 1)) (not (<= .cse12 0))))))))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-02 20:30:04,777 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0)) (let ((.cse1 (* c_~t~0 2)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse5 (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse2 (select .cse5 ~q2~0.base))) (let ((.cse0 (select .cse2 .cse7))) (let ((.cse4 (+ .cse0 1))) (or (<= (+ c_~s~0 .cse0) (+ .cse1 (* 2 (select .cse2 .cse3)) 1)) (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) .cse6) .cse4)))))))) (not (= (select (select .cse8 c_~q1~0.base) .cse9) 0))))) (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse10 (select .cse13 ~q2~0.base))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse12 (+ .cse11 1))) (or (< (+ .cse1 (* 2 (select .cse10 .cse3))) (+ c_~s~0 .cse11)) (not (<= .cse12 0)) (not (<= (select (select .cse13 c_~q1~0.base) .cse6) .cse12)))))))) (not (= (select (select .cse14 c_~q1~0.base) .cse9) 0)))))))) is different from false [2022-11-02 20:30:06,085 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post29#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q1_back~0)) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (* c_~t~0 2)) (.cse8 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (not (= (select (select .cse0 c_~q1~0.base) .cse1) 0)) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse7 (select .cse2 ~q2~0.base))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse4 (+ .cse5 1))) (or (not (<= (select (select .cse2 c_~q1~0.base) .cse3) .cse4)) (<= (+ c_~s~0 .cse5) (+ .cse6 (* (select .cse7 .cse8) 2) 1)) (not (<= .cse4 0))))))))))) (forall ((v_ArrVal_221 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_221))) (or (not (= (select (select .cse10 c_~q1~0.base) .cse1) 0)) (forall ((~q2~0.base Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse11 (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_223))) (let ((.cse13 (select .cse11 ~q2~0.base))) (let ((.cse14 (select .cse13 .cse9))) (let ((.cse12 (+ .cse14 1))) (or (not (<= (select (select .cse11 c_~q1~0.base) .cse3) .cse12)) (< (+ .cse6 (* (select .cse13 .cse8) 2)) (+ c_~s~0 .cse14)) (not (<= .cse12 0))))))))))))) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-02 20:30:20,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:20,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 147 [2022-11-02 20:30:20,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:20,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55101948 treesize of output 53265864