./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8 --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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --- 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-2329fc7 [2022-12-13 19:57:04,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:57:04,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:57:04,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:57:04,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:57:04,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:57:04,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:57:04,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:57:04,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:57:04,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:57:04,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:57:04,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:57:04,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:57:04,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:57:04,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:57:04,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:57:04,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:57:04,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:57:04,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:57:04,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:57:04,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:57:04,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:57:04,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:57:04,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:57:04,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:57:04,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:57:04,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:57:04,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:57:04,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:57:04,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:57:04,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:57:04,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:57:04,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:57:04,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:57:04,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:57:04,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:57:04,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:57:04,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:57:04,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:57:04,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:57:04,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:57:04,171 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:57:04,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:57:04,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:57:04,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:57:04,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:57:04,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:57:04,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:57:04,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:57:04,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:57:04,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:57:04,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:57:04,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:57:04,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:57:04,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:57:04,204 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:57:04,205 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/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_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a [2022-12-13 19:57:04,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:57:04,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:57:04,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:57:04,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:57:04,422 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:57:04,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-12-13 19:57:07,015 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:57:07,159 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:57:07,159 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-12-13 19:57:07,164 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/data/cd3623be3/7457f5e406c4474ea95c21cab6a299b1/FLAG7e444535e [2022-12-13 19:57:07,177 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/data/cd3623be3/7457f5e406c4474ea95c21cab6a299b1 [2022-12-13 19:57:07,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:57:07,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:57:07,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:57:07,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:57:07,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:57:07,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75474929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07, skipping insertion in model container [2022-12-13 19:57:07,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:57:07,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:57:07,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,367 WARN L237 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_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-13 19:57:07,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:57:07,382 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:57:07,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:57:07,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:57:07,400 WARN L237 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_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-13 19:57:07,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:57:07,414 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:57:07,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07 WrapperNode [2022-12-13 19:57:07,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:57:07,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:57:07,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:57:07,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:57:07,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,449 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-13 19:57:07,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:57:07,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:57:07,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:57:07,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:57:07,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:57:07,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:57:07,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:57:07,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:57:07,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (1/1) ... [2022-12-13 19:57:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:57:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:57:07,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:57:07,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 19:57:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 19:57:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:57:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:57:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:57:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:57:07,543 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 19:57:07,620 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:57:07,622 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:57:07,866 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:57:07,926 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:57:07,926 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 19:57:07,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:57:07 BoogieIcfgContainer [2022-12-13 19:57:07,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:57:07,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:57:07,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:57:07,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:57:07,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:57:07" (1/3) ... [2022-12-13 19:57:07,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9fc634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:57:07, skipping insertion in model container [2022-12-13 19:57:07,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:57:07" (2/3) ... [2022-12-13 19:57:07,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9fc634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:57:07, skipping insertion in model container [2022-12-13 19:57:07,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:57:07" (3/3) ... [2022-12-13 19:57:07,937 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-13 19:57:07,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:57:07,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:57:07,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:57:07,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:57:08,006 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 19:57:08,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2022-12-13 19:57:08,084 INFO L130 PetriNetUnfolder]: 15/187 cut-off events. [2022-12-13 19:57:08,084 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:57:08,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 15/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-12-13 19:57:08,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2022-12-13 19:57:08,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2022-12-13 19:57:08,095 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:57:08,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 178 transitions, 368 flow [2022-12-13 19:57:08,105 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 178 transitions, 368 flow [2022-12-13 19:57:08,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 178 transitions, 368 flow [2022-12-13 19:57:08,133 INFO L130 PetriNetUnfolder]: 15/178 cut-off events. [2022-12-13 19:57:08,133 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:57:08,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 15/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-12-13 19:57:08,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 19:57:12,807 INFO L134 LiptonReduction]: Checked pairs total: 1360 [2022-12-13 19:57:12,807 INFO L136 LiptonReduction]: Total number of compositions: 193 [2022-12-13 19:57:12,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:57:12,826 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;@645c5027, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:57:12,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 19:57:12,832 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-13 19:57:12,832 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:57:12,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:12,833 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:12,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1842166282, now seen corresponding path program 1 times [2022-12-13 19:57:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:12,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105340685] [2022-12-13 19:57:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:57:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105340685] [2022-12-13 19:57:13,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105340685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:57:13,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:57:13,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:57:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722620426] [2022-12-13 19:57:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:13,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:57:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:57:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:57:13,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 382 [2022-12-13 19:57:13,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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-12-13 19:57:13,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:13,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 382 [2022-12-13 19:57:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:13,294 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-13 19:57:13,294 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 19:57:13,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 120 events. 64/120 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 367 event pairs, 42 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 204. Up to 112 conditions per place. [2022-12-13 19:57:13,295 INFO L137 encePairwiseOnDemand]: 379/382 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-13 19:57:13,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 104 flow [2022-12-13 19:57:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:57:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:57:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-12-13 19:57:13,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4467713787085515 [2022-12-13 19:57:13,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-12-13 19:57:13,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-12-13 19:57:13,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:13,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-12-13 19:57:13,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-12-13 19:57:13,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 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-12-13 19:57:13,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 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-12-13 19:57:13,319 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 3 states and 512 transitions. [2022-12-13 19:57:13,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 104 flow [2022-12-13 19:57:13,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 19:57:13,322 INFO L231 Difference]: Finished difference. Result has 24 places, 24 transitions, 62 flow [2022-12-13 19:57:13,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=24} [2022-12-13 19:57:13,326 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2022-12-13 19:57:13,327 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 24 transitions, 62 flow [2022-12-13 19:57:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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-12-13 19:57:13,327 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:13,327 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:13,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:57:13,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1553130218, now seen corresponding path program 1 times [2022-12-13 19:57:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:13,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861474548] [2022-12-13 19:57:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:57:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861474548] [2022-12-13 19:57:13,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861474548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362568505] [2022-12-13 19:57:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:57:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:57:13,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:57:13,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:57:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:13,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:57:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:57:13,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:57:13,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362568505] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:13,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:57:13,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2022-12-13 19:57:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280310] [2022-12-13 19:57:13,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:57:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:57:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:57:13,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 382 [2022-12-13 19:57:13,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 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-12-13 19:57:13,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:13,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 382 [2022-12-13 19:57:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:13,813 INFO L130 PetriNetUnfolder]: 107/194 cut-off events. [2022-12-13 19:57:13,813 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:57:13,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 194 events. 107/194 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 729 event pairs, 29 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 386. Up to 71 conditions per place. [2022-12-13 19:57:13,816 INFO L137 encePairwiseOnDemand]: 375/382 looper letters, 29 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2022-12-13 19:57:13,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 39 transitions, 168 flow [2022-12-13 19:57:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:57:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:57:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 962 transitions. [2022-12-13 19:57:13,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41972076788830714 [2022-12-13 19:57:13,822 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 962 transitions. [2022-12-13 19:57:13,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 962 transitions. [2022-12-13 19:57:13,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:13,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 962 transitions. [2022-12-13 19:57:13,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.33333333333334) internal successors, (962), 6 states have internal predecessors, (962), 0 states have call successors, (0), 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-12-13 19:57:13,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 382.0) internal successors, (2674), 7 states have internal predecessors, (2674), 0 states have call successors, (0), 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-12-13 19:57:13,832 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 382.0) internal successors, (2674), 7 states have internal predecessors, (2674), 0 states have call successors, (0), 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-12-13 19:57:13,832 INFO L175 Difference]: Start difference. First operand has 24 places, 24 transitions, 62 flow. Second operand 6 states and 962 transitions. [2022-12-13 19:57:13,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 39 transitions, 168 flow [2022-12-13 19:57:13,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 19:57:13,834 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2022-12-13 19:57:13,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2022-12-13 19:57:13,834 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-13 19:57:13,835 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2022-12-13 19:57:13,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 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-12-13 19:57:13,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:13,836 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:13,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:57:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:57:14,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1889599176, now seen corresponding path program 1 times [2022-12-13 19:57:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642530361] [2022-12-13 19:57:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:57:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642530361] [2022-12-13 19:57:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642530361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:57:14,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:57:14,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:57:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833224596] [2022-12-13 19:57:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:57:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:57:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:57:14,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 382 [2022-12-13 19:57:14,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 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-12-13 19:57:14,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:14,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 382 [2022-12-13 19:57:14,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:14,385 INFO L130 PetriNetUnfolder]: 217/357 cut-off events. [2022-12-13 19:57:14,385 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 19:57:14,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 357 events. 217/357 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1283 event pairs, 33 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 848. Up to 124 conditions per place. [2022-12-13 19:57:14,387 INFO L137 encePairwiseOnDemand]: 376/382 looper letters, 36 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2022-12-13 19:57:14,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 260 flow [2022-12-13 19:57:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:57:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:57:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2022-12-13 19:57:14,389 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45078534031413614 [2022-12-13 19:57:14,389 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 861 transitions. [2022-12-13 19:57:14,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 861 transitions. [2022-12-13 19:57:14,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:14,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 861 transitions. [2022-12-13 19:57:14,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 0 states have call successors, (0), 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-12-13 19:57:14,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 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-12-13 19:57:14,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 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-12-13 19:57:14,393 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 5 states and 861 transitions. [2022-12-13 19:57:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 260 flow [2022-12-13 19:57:14,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 50 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:57:14,395 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 181 flow [2022-12-13 19:57:14,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-13 19:57:14,395 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-13 19:57:14,396 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 181 flow [2022-12-13 19:57:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 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-12-13 19:57:14,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:14,396 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:57:14,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1215597854, now seen corresponding path program 2 times [2022-12-13 19:57:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:14,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691183107] [2022-12-13 19:57:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:57:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:14,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691183107] [2022-12-13 19:57:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691183107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:57:14,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:57:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:57:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518040779] [2022-12-13 19:57:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:57:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:57:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:57:14,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 382 [2022-12-13 19:57:14,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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-12-13 19:57:14,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:14,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 382 [2022-12-13 19:57:14,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:14,589 INFO L130 PetriNetUnfolder]: 283/474 cut-off events. [2022-12-13 19:57:14,589 INFO L131 PetriNetUnfolder]: For 803/811 co-relation queries the response was YES. [2022-12-13 19:57:14,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 474 events. 283/474 cut-off events. For 803/811 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1805 event pairs, 81 based on Foata normal form. 5/463 useless extension candidates. Maximal degree in co-relation 1475. Up to 244 conditions per place. [2022-12-13 19:57:14,593 INFO L137 encePairwiseOnDemand]: 379/382 looper letters, 46 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2022-12-13 19:57:14,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 403 flow [2022-12-13 19:57:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:57:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:57:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2022-12-13 19:57:14,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4694589877835951 [2022-12-13 19:57:14,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2022-12-13 19:57:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2022-12-13 19:57:14,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:14,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2022-12-13 19:57:14,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-12-13 19:57:14,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 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-12-13 19:57:14,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 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-12-13 19:57:14,601 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 181 flow. Second operand 3 states and 538 transitions. [2022-12-13 19:57:14,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 403 flow [2022-12-13 19:57:14,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 403 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:57:14,605 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 193 flow [2022-12-13 19:57:14,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-13 19:57:14,606 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2022-12-13 19:57:14,606 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 193 flow [2022-12-13 19:57:14,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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-12-13 19:57:14,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:14,607 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:14,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:57:14,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash 738085492, now seen corresponding path program 1 times [2022-12-13 19:57:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:14,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973647724] [2022-12-13 19:57:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:57:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:14,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973647724] [2022-12-13 19:57:14,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973647724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:57:14,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:57:14,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:57:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61314316] [2022-12-13 19:57:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:14,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:57:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:57:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:57:14,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 382 [2022-12-13 19:57:14,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-13 19:57:14,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:14,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 382 [2022-12-13 19:57:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:14,965 INFO L130 PetriNetUnfolder]: 307/530 cut-off events. [2022-12-13 19:57:14,965 INFO L131 PetriNetUnfolder]: For 638/638 co-relation queries the response was YES. [2022-12-13 19:57:14,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 530 events. 307/530 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2067 event pairs, 70 based on Foata normal form. 26/555 useless extension candidates. Maximal degree in co-relation 1746. Up to 403 conditions per place. [2022-12-13 19:57:14,967 INFO L137 encePairwiseOnDemand]: 377/382 looper letters, 44 selfloop transitions, 2 changer transitions 15/61 dead transitions. [2022-12-13 19:57:14,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 419 flow [2022-12-13 19:57:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:57:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:57:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2022-12-13 19:57:14,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44136125654450264 [2022-12-13 19:57:14,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 843 transitions. [2022-12-13 19:57:14,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 843 transitions. [2022-12-13 19:57:14,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:14,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 843 transitions. [2022-12-13 19:57:14,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 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-12-13 19:57:14,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 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-12-13 19:57:14,974 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 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-12-13 19:57:14,974 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 193 flow. Second operand 5 states and 843 transitions. [2022-12-13 19:57:14,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 419 flow [2022-12-13 19:57:14,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:57:14,976 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 211 flow [2022-12-13 19:57:14,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 19:57:14,977 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2022-12-13 19:57:14,977 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 211 flow [2022-12-13 19:57:14,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-13 19:57:14,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:14,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:14,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:57:14,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash -724333116, now seen corresponding path program 1 times [2022-12-13 19:57:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:14,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288518379] [2022-12-13 19:57:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:57:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288518379] [2022-12-13 19:57:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288518379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:57:15,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:57:15,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:57:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570774709] [2022-12-13 19:57:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:57:15,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:57:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:57:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:57:15,104 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 382 [2022-12-13 19:57:15,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 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-12-13 19:57:15,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:15,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 382 [2022-12-13 19:57:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:15,193 INFO L130 PetriNetUnfolder]: 284/504 cut-off events. [2022-12-13 19:57:15,193 INFO L131 PetriNetUnfolder]: For 1300/1317 co-relation queries the response was YES. [2022-12-13 19:57:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 504 events. 284/504 cut-off events. For 1300/1317 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1976 event pairs, 159 based on Foata normal form. 21/507 useless extension candidates. Maximal degree in co-relation 1580. Up to 397 conditions per place. [2022-12-13 19:57:15,195 INFO L137 encePairwiseOnDemand]: 378/382 looper letters, 31 selfloop transitions, 2 changer transitions 16/54 dead transitions. [2022-12-13 19:57:15,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 403 flow [2022-12-13 19:57:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:57:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:57:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-12-13 19:57:15,197 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4430628272251309 [2022-12-13 19:57:15,197 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2022-12-13 19:57:15,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2022-12-13 19:57:15,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:15,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2022-12-13 19:57:15,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-12-13 19:57:15,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 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-12-13 19:57:15,200 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 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-12-13 19:57:15,200 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 211 flow. Second operand 4 states and 677 transitions. [2022-12-13 19:57:15,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 403 flow [2022-12-13 19:57:15,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 395 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 19:57:15,203 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 217 flow [2022-12-13 19:57:15,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-13 19:57:15,203 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2022-12-13 19:57:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 217 flow [2022-12-13 19:57:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 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-12-13 19:57:15,204 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:15,204 INFO L209 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] [2022-12-13 19:57:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:57:15,204 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 764011229, now seen corresponding path program 1 times [2022-12-13 19:57:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:15,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057671394] [2022-12-13 19:57:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:57:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:16,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057671394] [2022-12-13 19:57:16,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057671394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:16,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534770874] [2022-12-13 19:57:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:57:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:57:16,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:57:16,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:57:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:16,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 19:57:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:16,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:57:16,548 INFO L350 Elim1Store]: Elim1 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-12-13 19:57:16,862 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 19:57:16,863 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 10 [2022-12-13 19:57:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:57:16,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:17,338 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-13 19:57:17,338 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 255 [2022-12-13 19:57:17,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:17,361 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 189 [2022-12-13 19:57:17,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:17,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 144 treesize of output 137 [2022-12-13 19:57:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:57:18,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534770874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:57:18,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:57:18,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-13 19:57:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411973045] [2022-12-13 19:57:18,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:57:18,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 19:57:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 19:57:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=608, Unknown=1, NotChecked=0, Total=756 [2022-12-13 19:57:19,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 382 [2022-12-13 19:57:19,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 217 flow. Second operand has 28 states, 28 states have (on average 98.35714285714286) internal successors, (2754), 28 states have internal predecessors, (2754), 0 states have call successors, (0), 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-12-13 19:57:19,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:19,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 382 [2022-12-13 19:57:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:24,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~end~0 4)) (.cse17 (* c_~start~0 4))) (let ((.cse3 (= .cse16 .cse17)) (.cse6 (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0))) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse11 (+ .cse17 c_~queue~0.offset)) (.cse12 (+ c_~v_old~0 1)) (.cse8 (+ .cse16 c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse1 (< c_~start~0 0)) (.cse4 (not (<= 0 c_~end~0))) (.cse5 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse0 .cse1 (and (forall ((~queue~0.base Int) (v_ArrVal_156 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (let ((.cse7 (select .cse9 ~queue~0.base))) (or (not (= (select .cse7 .cse8) (select (select .cse9 c_~A~0.base) .cse10))) (< (select .cse7 .cse11) .cse12))))) (or .cse2 (forall ((~queue~0.base Int) (v_ArrVal_156 (Array Int Int))) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (= (select (select .cse13 ~queue~0.base) .cse8) (select (select .cse13 c_~A~0.base) .cse10))))))) .cse4 .cse5) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse11) .cse12) .cse2) .cse1 .cse5) (= c_~ok~0 1) (or .cse0 .cse1 .cse4 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (< c_~last~0 .cse12) .cse2 .cse3) .cse5) (or .cse0 .cse1 (and .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3) .cse4 .cse5) (or .cse6 .cse0 (let ((.cse15 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (and (forall ((~queue~0.base Int)) (let ((.cse14 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse14 .cse8) .cse15)) (< (select .cse14 .cse11) .cse12)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse8) .cse15))) .cse2))) .cse1 .cse4 .cse5)))) is different from false [2022-12-13 19:57:27,294 INFO L130 PetriNetUnfolder]: 2273/3800 cut-off events. [2022-12-13 19:57:27,294 INFO L131 PetriNetUnfolder]: For 5244/5244 co-relation queries the response was YES. [2022-12-13 19:57:27,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13499 conditions, 3800 events. 2273/3800 cut-off events. For 5244/5244 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21595 event pairs, 166 based on Foata normal form. 9/3804 useless extension candidates. Maximal degree in co-relation 13475. Up to 802 conditions per place. [2022-12-13 19:57:27,316 INFO L137 encePairwiseOnDemand]: 362/382 looper letters, 349 selfloop transitions, 193 changer transitions 93/635 dead transitions. [2022-12-13 19:57:27,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 635 transitions, 4637 flow [2022-12-13 19:57:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-13 19:57:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-13 19:57:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 6465 transitions. [2022-12-13 19:57:27,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.27296909305860495 [2022-12-13 19:57:27,335 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 6465 transitions. [2022-12-13 19:57:27,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 6465 transitions. [2022-12-13 19:57:27,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:57:27,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 6465 transitions. [2022-12-13 19:57:27,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 104.2741935483871) internal successors, (6465), 62 states have internal predecessors, (6465), 0 states have call successors, (0), 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-12-13 19:57:27,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 382.0) internal successors, (24066), 63 states have internal predecessors, (24066), 0 states have call successors, (0), 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-12-13 19:57:27,383 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 382.0) internal successors, (24066), 63 states have internal predecessors, (24066), 0 states have call successors, (0), 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-12-13 19:57:27,383 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 217 flow. Second operand 62 states and 6465 transitions. [2022-12-13 19:57:27,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 635 transitions, 4637 flow [2022-12-13 19:57:27,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 635 transitions, 4609 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 19:57:27,397 INFO L231 Difference]: Finished difference. Result has 144 places, 241 transitions, 2406 flow [2022-12-13 19:57:27,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=2406, PETRI_PLACES=144, PETRI_TRANSITIONS=241} [2022-12-13 19:57:27,397 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 119 predicate places. [2022-12-13 19:57:27,397 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 241 transitions, 2406 flow [2022-12-13 19:57:27,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 98.35714285714286) internal successors, (2754), 28 states have internal predecessors, (2754), 0 states have call successors, (0), 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-12-13 19:57:27,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:57:27,398 INFO L209 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] [2022-12-13 19:57:27,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:57:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:57:27,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:57:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2128464811, now seen corresponding path program 2 times [2022-12-13 19:57:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:57:27,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525321194] [2022-12-13 19:57:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:57:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:57:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:57:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525321194] [2022-12-13 19:57:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525321194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320033320] [2022-12-13 19:57:28,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:57:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:57:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:57:28,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:57:28,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:57:28,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:57:28,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:57:28,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 19:57:28,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:28,466 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 19:57:28,466 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 26 treesize of output 31 [2022-12-13 19:57:28,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:57:28,568 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-12-13 19:57:28,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-12-13 19:57:28,612 INFO L350 Elim1Store]: Elim1 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-12-13 19:57:28,649 INFO L350 Elim1Store]: Elim1 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-12-13 19:57:28,781 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 19:57:28,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 19:57:28,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 19:57:28,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:57:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:57:28,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:29,280 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int)) (~A~0.base Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_203))) (let ((.cse1 (select (select .cse0 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (forall ((v_ArrVal_204 (Array Int Int))) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_204) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ .cse1 1)))))))) (not (<= 0 c_~end~0))) is different from false [2022-12-13 19:57:29,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:29,411 INFO L350 Elim1Store]: Elim1 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 117 treesize of output 81 [2022-12-13 19:57:29,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:29,441 INFO L350 Elim1Store]: Elim1 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 5260 treesize of output 4670 [2022-12-13 19:57:29,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3158 treesize of output 2774 [2022-12-13 19:57:29,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:29,512 INFO L350 Elim1Store]: Elim1 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 4236 treesize of output 3320 [2022-12-13 19:57:29,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:57:29,565 INFO L350 Elim1Store]: Elim1 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 3276 treesize of output 2840 [2022-12-13 19:57:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 19:57:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320033320] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:57:33,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:57:33,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-12-13 19:57:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205780714] [2022-12-13 19:57:33,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:57:33,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 19:57:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:57:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 19:57:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=644, Unknown=3, NotChecked=54, Total=870 [2022-12-13 19:57:34,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 382 [2022-12-13 19:57:34,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 241 transitions, 2406 flow. Second operand has 30 states, 30 states have (on average 92.2) internal successors, (2766), 30 states have internal predecessors, (2766), 0 states have call successors, (0), 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-12-13 19:57:34,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:57:34,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 382 [2022-12-13 19:57:34,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:57:34,764 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))) (.cse1 (and (forall ((v_ArrVal_204 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_204) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1))) (not (= (mod c_~ok~0 256) 0)))) (.cse2 (not (<= 0 c_~end~0)))) (and (or .cse0 .cse1 .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse4 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (< ~i~0 c_~N~0)) (not (= .cse3 .cse4)) (< c_~last~0 .cse4))))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 (not (= .cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse1 .cse2))) is different from false [2022-12-13 19:57:36,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:43,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:45,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:51,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:54,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:57,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:59,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:58:07,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:58:10,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:58:15,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse5 (* c_~start~0 4)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse1 (not (<= 0 c_~end~0))) (.cse4 (* c_~end~0 4))) (and (or .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (let ((.cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0))))) (and (or .cse2 .cse3) (or (= .cse4 .cse5) .cse3) (or .cse3 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))))) (or .cse0 (and (forall ((v_ArrVal_204 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_204) c_~queue~0.base) (+ .cse5 c_~queue~0.offset)) (+ c_~v_old~0 1))) .cse2) .cse1 (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse6 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (< ~i~0 c_~N~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ .cse4 c_~queue~0.offset)) .cse6)) (< c_~last~0 .cse6))))))) is different from false [2022-12-13 19:58:27,503 INFO L130 PetriNetUnfolder]: 6749/11198 cut-off events. [2022-12-13 19:58:27,503 INFO L131 PetriNetUnfolder]: For 168200/168200 co-relation queries the response was YES. [2022-12-13 19:58:27,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74444 conditions, 11198 events. 6749/11198 cut-off events. For 168200/168200 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 77800 event pairs, 606 based on Foata normal form. 27/11224 useless extension candidates. Maximal degree in co-relation 66049. Up to 6779 conditions per place. [2022-12-13 19:58:27,587 INFO L137 encePairwiseOnDemand]: 363/382 looper letters, 600 selfloop transitions, 453 changer transitions 142/1195 dead transitions. [2022-12-13 19:58:27,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1195 transitions, 15380 flow [2022-12-13 19:58:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 19:58:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-13 19:58:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 5541 transitions. [2022-12-13 19:58:27,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.25447781758060073 [2022-12-13 19:58:27,594 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 5541 transitions. [2022-12-13 19:58:27,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 5541 transitions. [2022-12-13 19:58:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:58:27,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 5541 transitions. [2022-12-13 19:58:27,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 97.21052631578948) internal successors, (5541), 57 states have internal predecessors, (5541), 0 states have call successors, (0), 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-12-13 19:58:27,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 382.0) internal successors, (22156), 58 states have internal predecessors, (22156), 0 states have call successors, (0), 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-12-13 19:58:27,645 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 382.0) internal successors, (22156), 58 states have internal predecessors, (22156), 0 states have call successors, (0), 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-12-13 19:58:27,646 INFO L175 Difference]: Start difference. First operand has 144 places, 241 transitions, 2406 flow. Second operand 57 states and 5541 transitions. [2022-12-13 19:58:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1195 transitions, 15380 flow [2022-12-13 19:58:28,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 1195 transitions, 14785 flow, removed 294 selfloop flow, removed 6 redundant places. [2022-12-13 19:58:28,628 INFO L231 Difference]: Finished difference. Result has 228 places, 678 transitions, 8919 flow [2022-12-13 19:58:28,629 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8919, PETRI_PLACES=228, PETRI_TRANSITIONS=678} [2022-12-13 19:58:28,629 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 203 predicate places. [2022-12-13 19:58:28,629 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 678 transitions, 8919 flow [2022-12-13 19:58:28,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 92.2) internal successors, (2766), 30 states have internal predecessors, (2766), 0 states have call successors, (0), 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-12-13 19:58:28,630 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:58:28,630 INFO L209 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] [2022-12-13 19:58:28,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:58:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:28,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:58:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -807741499, now seen corresponding path program 3 times [2022-12-13 19:58:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678277914] [2022-12-13 19:58:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:58:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:29,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678277914] [2022-12-13 19:58:29,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678277914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:29,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894794865] [2022-12-13 19:58:29,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:58:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:29,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:58:29,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:58:29,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 19:58:29,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:58:29,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 19:58:29,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:29,852 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-12-13 19:58:29,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:29,910 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-12-13 19:58:29,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:29,997 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-12-13 19:58:30,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:30,189 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 19:58:30,190 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 10 [2022-12-13 19:58:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:30,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:31,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:31,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2022-12-13 19:58:31,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:31,335 INFO L350 Elim1Store]: Elim1 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 1101 treesize of output 1071 [2022-12-13 19:58:31,377 INFO L321 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2022-12-13 19:58:31,378 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1435 treesize of output 1416 [2022-12-13 19:58:31,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:31,413 INFO L350 Elim1Store]: Elim1 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 1452 treesize of output 1232 [2022-12-13 19:58:31,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:31,450 INFO L350 Elim1Store]: Elim1 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 1022 treesize of output 934 [2022-12-13 19:58:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:34,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 190 [2022-12-13 19:58:35,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:35,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 212 [2022-12-13 19:58:35,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:35,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-12-13 19:58:35,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:35,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:35,454 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 19:58:35,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 138 [2022-12-13 19:58:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:35,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894794865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:58:35,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:58:35,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-12-13 19:58:35,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541518405] [2022-12-13 19:58:35,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:35,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 19:58:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:35,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 19:58:35,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=661, Unknown=17, NotChecked=0, Total=812 [2022-12-13 19:58:37,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 382 [2022-12-13 19:58:37,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 678 transitions, 8919 flow. Second operand has 29 states, 29 states have (on average 91.27586206896552) internal successors, (2647), 29 states have internal predecessors, (2647), 0 states have call successors, (0), 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-12-13 19:58:37,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:58:37,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 382 [2022-12-13 19:58:37,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:58:46,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse9 (not (< c_~end~0 c_~n~0))) (.cse4 (+ c_~v_old~0 1)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ c_~A~0.offset (* c_~i~0 4))) (.cse10 (not (<= 0 c_~end~0))) (.cse11 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse1 (= .cse3 0))) (and (or (not (= .cse0 0)) .cse1 (and (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= c_~end~0 c_~start~0))) (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse2 (select .cse5 ~queue~0.base))) (or (< (select .cse2 .cse3) .cse4) (not (= (select .cse2 .cse0) (select (select .cse5 c_~A~0.base) .cse6))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse7 ~queue~0.base) .cse0) (select (select .cse7 c_~A~0.base) .cse6))))) .cse8)) .cse9 .cse10 .cse11) (= c_~ok~0 1) (or .cse9 (let ((.cse13 (select (select |c_#memory_int| c_~A~0.base) .cse6))) (and (forall ((~queue~0.base Int)) (let ((.cse12 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse12 .cse0) .cse13)) (< (select .cse12 .cse3) .cse4)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse0) .cse13))) .cse8))) .cse10 .cse11) (<= (select (select |c_#memory_int| c_~queue~0.base) .cse3) c_~v_old~0) (or (<= .cse0 0) (<= c_~n~0 1)) (= c_~queue~0.offset 0) .cse1 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-12-13 19:58:51,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (* c_~i~0 4)) (.cse21 (* c_~end~0 4)) (.cse22 (* c_~start~0 4))) (let ((.cse6 (+ .cse22 c_~queue~0.offset)) (.cse10 (+ c_~v_old~0 1)) (.cse7 (+ .cse21 c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse12 (+ c_~A~0.offset .cse20))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse3 (= .cse21 .cse22)) (.cse4 (= .cse20 0)) (.cse1 (< c_~end~0 0)) (.cse16 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse14 (not (< c_~end~0 c_~n~0))) (.cse17 (let ((.cse19 (select (select |c_#memory_int| c_~A~0.base) .cse12))) (and (forall ((~queue~0.base Int)) (let ((.cse18 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse18 .cse7) .cse19)) (< (select .cse18 .cse6) .cse10)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse7) .cse19))) .cse2)))) (.cse15 (not (<= 0 c_~end~0))) (.cse8 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (<= c_~start~0 0) (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse2 .cse3 (not (< |c_ULTIMATE.start_main_~#t1~0#1.base| |c_#StackHeapBarrier|)) .cse4)) (<= 0 c_~start~0) (exists ((~A~0.base Int)) (let ((.cse5 (select (select |c_#memory_int| ~A~0.base) 0))) (and (<= .cse5 c_~v_old~0) (= (select (select |c_#memory_int| c_~queue~0.base) .cse6) .cse5)))) (or (not (= .cse7 0)) (= .cse6 0) (and (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= c_~end~0 c_~start~0))) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2 .cse3 .cse4 .cse8) .cse1) (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse9 (select .cse11 ~queue~0.base))) (or (< (select .cse9 .cse6) .cse10) (not (= (select .cse9 .cse7) (select (select .cse11 c_~A~0.base) .cse12))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse13 ~queue~0.base) .cse7) (select (select .cse13 c_~A~0.base) .cse12))))) .cse2)) .cse14 .cse15 .cse16) (= c_~ok~0 1) (= |c_thread2Thread1of1ForFork1_~cond~0#1| 1) (or .cse14 .cse17 .cse15 .cse16) (or (<= .cse7 0) (<= c_~n~0 1)) (= c_~queue~0.offset 0) (or .cse14 .cse17 .cse15 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) .cse8)))) is different from false [2022-12-13 19:58:55,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ c_~v_old~0 1)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse8 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse0 (select .cse4 ~queue~0.base))) (or (< (select .cse0 .cse1) .cse2) (not (= (select .cse0 .cse3) (select (select .cse4 c_~A~0.base) .cse5))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse6 ~queue~0.base) .cse3) (select (select .cse6 c_~A~0.base) .cse5))))) .cse7)) (<= c_~n~0 c_~end~0) (< c_~end~0 0) (<= c_~N~0 c_~i~0)) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse1) .cse2) .cse7) .cse8) (= c_~ok~0 1) (or (not (< c_~end~0 c_~n~0)) (let ((.cse10 (select (select |c_#memory_int| c_~A~0.base) .cse5))) (and (forall ((~queue~0.base Int)) (let ((.cse9 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse9 .cse3) .cse10)) (< (select .cse9 .cse1) .cse2)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse3) .cse10))) .cse7))) (not (<= 0 c_~end~0)) .cse8))) is different from false [2022-12-13 19:58:56,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (* c_~i~0 4)) (.cse21 (* c_~end~0 4)) (.cse22 (* c_~start~0 4))) (let ((.cse6 (+ .cse22 c_~queue~0.offset)) (.cse9 (+ c_~v_old~0 1)) (.cse5 (+ .cse21 c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse11 (+ c_~A~0.offset .cse20))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse3 (= .cse21 .cse22)) (.cse4 (= .cse20 0)) (.cse1 (< c_~end~0 0)) (.cse15 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse13 (not (< c_~end~0 c_~n~0))) (.cse17 (let ((.cse19 (select (select |c_#memory_int| c_~A~0.base) .cse11))) (and (forall ((~queue~0.base Int)) (let ((.cse18 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse18 .cse5) .cse19)) (< (select .cse18 .cse6) .cse9)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse5) .cse19))) .cse2)))) (.cse14 (not (<= 0 c_~end~0))) (.cse16 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (.cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse2 .cse3 (not (< |c_ULTIMATE.start_main_~#t1~0#1.base| |c_#StackHeapBarrier|)) .cse4)) (or (not (= .cse5 0)) (= .cse6 0) (and (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= c_~end~0 c_~start~0))) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2 .cse3 .cse4 .cse7) .cse1) (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse8 (select .cse10 ~queue~0.base))) (or (< (select .cse8 .cse6) .cse9) (not (= (select .cse8 .cse5) (select (select .cse10 c_~A~0.base) .cse11))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse12 ~queue~0.base) .cse5) (select (select .cse12 c_~A~0.base) .cse11))))) .cse2)) .cse13 .cse14 .cse15) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse6) .cse9) .cse2) .cse16) (= c_~ok~0 1) (or .cse13 .cse17 .cse14 .cse15) (or (<= .cse5 0) (<= c_~n~0 1)) (= c_~queue~0.offset 0) (or .cse13 .cse17 .cse14 .cse16) .cse7)))) is different from false [2022-12-13 19:58:56,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~i~0 4)) (.cse20 (* c_~end~0 4)) (.cse21 (* c_~start~0 4))) (let ((.cse6 (+ .cse21 c_~queue~0.offset)) (.cse7 (+ c_~v_old~0 1)) (.cse8 (+ .cse20 c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ c_~A~0.offset .cse19))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse3 (= .cse20 .cse21)) (.cse4 (= .cse19 0)) (.cse1 (< c_~end~0 0)) (.cse14 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse12 (not (< c_~end~0 c_~n~0))) (.cse16 (let ((.cse18 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (and (forall ((~queue~0.base Int)) (let ((.cse17 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse17 .cse8) .cse18)) (< (select .cse17 .cse6) .cse7)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse8) .cse18))) .cse2)))) (.cse13 (not (<= 0 c_~end~0))) (.cse15 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse2 .cse3 (not (< |c_ULTIMATE.start_main_~#t1~0#1.base| |c_#StackHeapBarrier|)) .cse4)) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2 .cse3 .cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse1) (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse5 (select .cse9 ~queue~0.base))) (or (< (select .cse5 .cse6) .cse7) (not (= (select .cse5 .cse8) (select (select .cse9 c_~A~0.base) .cse10))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse11 ~queue~0.base) .cse8) (select (select .cse11 c_~A~0.base) .cse10))))) .cse2)) .cse12 .cse13 .cse14) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse6) .cse7) .cse2) .cse15) (or .cse12 .cse16 .cse13 .cse14) (or .cse12 .cse16 .cse13 .cse15))))) is different from false [2022-12-13 19:58:57,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ c_~v_old~0 1)) (.cse7 (not (= (mod c_~ok~0 256) 0)))) (and (or (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse0 (select .cse4 ~queue~0.base))) (or (< (select .cse0 .cse1) .cse2) (not (= (select .cse0 .cse3) (select (select .cse4 c_~A~0.base) .cse5))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse6 ~queue~0.base) .cse3) (select (select .cse6 c_~A~0.base) .cse5))))) .cse7))) (<= c_~n~0 c_~end~0) (< c_~end~0 0) (<= c_~N~0 c_~i~0)) .cse7 (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse1) .cse2) .cse7) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-12-13 19:59:01,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ c_~v_old~0 1)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse8 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or (and (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (let ((.cse0 (select .cse4 ~queue~0.base))) (or (< (select .cse0 .cse1) .cse2) (not (= (select .cse0 .cse3) (select (select .cse4 c_~A~0.base) .cse5))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_246 (Array Int Int))) (not (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (= (select (select .cse6 ~queue~0.base) .cse3) (select (select .cse6 c_~A~0.base) .cse5))))) .cse7)) (<= c_~n~0 c_~end~0) (< c_~end~0 0) (<= c_~N~0 c_~i~0)) .cse7 (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse1) .cse2) .cse7) .cse8) (or (not (< c_~end~0 c_~n~0)) (let ((.cse10 (select (select |c_#memory_int| c_~A~0.base) .cse5))) (and (forall ((~queue~0.base Int)) (let ((.cse9 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse9 .cse3) .cse10)) (< (select .cse9 .cse1) .cse2)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse3) .cse10))) .cse7))) (not (<= 0 c_~end~0)) .cse8))) is different from false [2022-12-13 19:59:01,878 INFO L130 PetriNetUnfolder]: 11458/19650 cut-off events. [2022-12-13 19:59:01,878 INFO L131 PetriNetUnfolder]: For 455211/455211 co-relation queries the response was YES. [2022-12-13 19:59:02,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158333 conditions, 19650 events. 11458/19650 cut-off events. For 455211/455211 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 155542 event pairs, 295 based on Foata normal form. 37/19687 useless extension candidates. Maximal degree in co-relation 158083. Up to 12283 conditions per place. [2022-12-13 19:59:02,106 INFO L137 encePairwiseOnDemand]: 360/382 looper letters, 922 selfloop transitions, 913 changer transitions 148/1983 dead transitions. [2022-12-13 19:59:02,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1983 transitions, 31032 flow [2022-12-13 19:59:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-13 19:59:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-13 19:59:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 8068 transitions. [2022-12-13 19:59:02,118 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.24847551586079458 [2022-12-13 19:59:02,118 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 8068 transitions. [2022-12-13 19:59:02,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 8068 transitions. [2022-12-13 19:59:02,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:59:02,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 8068 transitions. [2022-12-13 19:59:02,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 94.91764705882353) internal successors, (8068), 85 states have internal predecessors, (8068), 0 states have call successors, (0), 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-12-13 19:59:02,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 382.0) internal successors, (32852), 86 states have internal predecessors, (32852), 0 states have call successors, (0), 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-12-13 19:59:02,156 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 382.0) internal successors, (32852), 86 states have internal predecessors, (32852), 0 states have call successors, (0), 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-12-13 19:59:02,157 INFO L175 Difference]: Start difference. First operand has 228 places, 678 transitions, 8919 flow. Second operand 85 states and 8068 transitions. [2022-12-13 19:59:02,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1983 transitions, 31032 flow [2022-12-13 19:59:06,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 1983 transitions, 28363 flow, removed 1290 selfloop flow, removed 11 redundant places. [2022-12-13 19:59:06,325 INFO L231 Difference]: Finished difference. Result has 343 places, 1381 transitions, 20005 flow [2022-12-13 19:59:06,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=8053, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=20005, PETRI_PLACES=343, PETRI_TRANSITIONS=1381} [2022-12-13 19:59:06,326 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 318 predicate places. [2022-12-13 19:59:06,326 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1381 transitions, 20005 flow [2022-12-13 19:59:06,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 91.27586206896552) internal successors, (2647), 29 states have internal predecessors, (2647), 0 states have call successors, (0), 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-12-13 19:59:06,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:06,326 INFO L209 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] [2022-12-13 19:59:06,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:59:06,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:06,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 19:59:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash -757762499, now seen corresponding path program 4 times [2022-12-13 19:59:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:06,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961110254] [2022-12-13 19:59:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:59:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961110254] [2022-12-13 19:59:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961110254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538015580] [2022-12-13 19:59:07,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:59:07,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:07,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:07,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:59:07,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:59:07,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:59:07,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 19:59:07,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:07,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:07,317 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 19:59:07,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 19:59:07,370 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-12-13 19:59:07,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 19:59:07,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-13 19:59:07,450 INFO L350 Elim1Store]: Elim1 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-12-13 19:59:07,462 INFO L350 Elim1Store]: Elim1 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-12-13 19:59:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:07,573 INFO L350 Elim1Store]: Elim1 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-12-13 19:59:07,844 INFO L321 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-12-13 19:59:07,844 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 13 [2022-12-13 19:59:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:59:07,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:09,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:09,013 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 51 [2022-12-13 19:59:09,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:09,043 INFO L350 Elim1Store]: Elim1 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 13558 treesize of output 12554 [2022-12-13 19:59:09,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:09,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12534 treesize of output 11015 [2022-12-13 19:59:09,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:09,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10998 treesize of output 7943 [2022-12-13 19:59:09,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:09,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7926 treesize of output 7175 [2022-12-13 19:59:10,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:10,625 INFO L350 Elim1Store]: Elim1 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 123 treesize of output 87 [2022-12-13 19:59:10,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:10,686 INFO L350 Elim1Store]: Elim1 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 34220 treesize of output 31454 [2022-12-13 19:59:10,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:10,826 INFO L350 Elim1Store]: Elim1 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 31404 treesize of output 24536 [2022-12-13 19:59:11,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:11,002 INFO L350 Elim1Store]: Elim1 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 24492 treesize of output 20312 [2022-12-13 19:59:11,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:11,149 INFO L350 Elim1Store]: Elim1 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 20268 treesize of output 18200 [2022-12-13 19:59:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:37,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538015580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:59:37,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:59:37,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-12-13 19:59:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071978694] [2022-12-13 19:59:37,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:37,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 19:59:37,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 19:59:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=643, Unknown=9, NotChecked=0, Total=812 [2022-12-13 19:59:39,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 382 [2022-12-13 19:59:39,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1381 transitions, 20005 flow. Second operand has 29 states, 29 states have (on average 95.27586206896552) internal successors, (2763), 29 states have internal predecessors, (2763), 0 states have call successors, (0), 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-12-13 19:59:39,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:39,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 382 [2022-12-13 19:59:39,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:59:41,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:59:41,388 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~start~0 4)) (.cse12 (* c_~end~0 4))) (let ((.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse12 c_~queue~0.offset)) (.cse7 (+ .cse13 c_~queue~0.offset)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~end~0 c_~start~0)) (.cse2 (< c_~start~0 0))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_~A~0.base_71 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_71) (forall ((~A~0.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~i~0 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292))) (let ((.cse3 (select .cse5 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse3 .cse4) (select (select .cse5 v_~A~0.base_71) .cse6))) (< (select .cse3 .cse7) (+ (select (select .cse8 v_~A~0.base_71) .cse6) 1))))))))) (or .cse9 (forall ((~A~0.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~i~0 Int) (v_~A~0.base_71 Int)) (or (not (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292))) (= (select (select .cse10 c_~queue~0.base) .cse4) (select (select .cse10 v_~A~0.base_71) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_71)))))) (or .cse0 .cse1 (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| |c_#StackHeapBarrier|)))))) (and (or .cse11 (= .cse12 .cse13)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| |c_#StackHeapBarrier|)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (or .cse11 .cse9))) .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse7) (+ c_~v_old~0 1)) .cse9) .cse2 (<= c_~end~0 c_~start~0) (<= c_~n~0 c_~start~0)) (= c_~ok~0 1) (or (and (or (forall ((~A~0.offset Int) (v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~i~0 Int) (v_~A~0.base_71 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_71) (not (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292))) (= (select (select .cse14 c_~queue~0.base) .cse4) (select (select .cse14 v_~A~0.base_71) (+ (* ~i~0 4) ~A~0.offset))))))) .cse9) (forall ((v_ArrVal_290 (Array Int Int)) (v_~A~0.base_71 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_71) (forall ((~A~0.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~i~0 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292))) (let ((.cse15 (select .cse16 c_~queue~0.base)) (.cse17 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse15 .cse4) (select (select .cse16 v_~A~0.base_71) .cse17))) (< (select .cse15 .cse7) (+ (select (select .cse18 v_~A~0.base_71) .cse17) 1)))))))))) .cse0 .cse1 .cse2)))) is different from false [2022-12-13 19:59:43,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:59:56,854 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 134 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:00:23,480 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:00:50,470 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 173 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:01:03,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:01:12,600 INFO L130 PetriNetUnfolder]: 18817/32084 cut-off events. [2022-12-13 20:01:12,600 INFO L131 PetriNetUnfolder]: For 1204662/1204662 co-relation queries the response was YES. [2022-12-13 20:01:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340249 conditions, 32084 events. 18817/32084 cut-off events. For 1204662/1204662 co-relation queries the response was YES. Maximal size of possible extension queue 1724. Compared 269627 event pairs, 988 based on Foata normal form. 107/32191 useless extension candidates. Maximal degree in co-relation 340093. Up to 20432 conditions per place. [2022-12-13 20:01:13,041 INFO L137 encePairwiseOnDemand]: 366/382 looper letters, 462 selfloop transitions, 324 changer transitions 2121/2907 dead transitions. [2022-12-13 20:01:13,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 2907 transitions, 50288 flow [2022-12-13 20:01:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 20:01:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-13 20:01:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4729 transitions. [2022-12-13 20:01:13,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2633953436560098 [2022-12-13 20:01:13,047 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4729 transitions. [2022-12-13 20:01:13,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4729 transitions. [2022-12-13 20:01:13,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:13,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4729 transitions. [2022-12-13 20:01:13,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 100.61702127659575) internal successors, (4729), 47 states have internal predecessors, (4729), 0 states have call successors, (0), 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-12-13 20:01:13,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 382.0) internal successors, (18336), 48 states have internal predecessors, (18336), 0 states have call successors, (0), 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-12-13 20:01:13,061 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 382.0) internal successors, (18336), 48 states have internal predecessors, (18336), 0 states have call successors, (0), 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-12-13 20:01:13,061 INFO L175 Difference]: Start difference. First operand has 343 places, 1381 transitions, 20005 flow. Second operand 47 states and 4729 transitions. [2022-12-13 20:01:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 2907 transitions, 50288 flow [2022-12-13 20:01:30,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 2907 transitions, 47304 flow, removed 1420 selfloop flow, removed 20 redundant places. [2022-12-13 20:01:30,024 INFO L231 Difference]: Finished difference. Result has 384 places, 600 transitions, 9702 flow [2022-12-13 20:01:30,024 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=18676, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1072, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=9702, PETRI_PLACES=384, PETRI_TRANSITIONS=600} [2022-12-13 20:01:30,025 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 359 predicate places. [2022-12-13 20:01:30,025 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 600 transitions, 9702 flow [2022-12-13 20:01:30,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 95.27586206896552) internal successors, (2763), 29 states have internal predecessors, (2763), 0 states have call successors, (0), 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-12-13 20:01:30,025 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:30,025 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:30,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:01:30,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:30,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:01:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1024909861, now seen corresponding path program 5 times [2022-12-13 20:01:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:30,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652054576] [2022-12-13 20:01:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:01:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652054576] [2022-12-13 20:01:31,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652054576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523504812] [2022-12-13 20:01:31,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:01:31,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:31,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:01:31,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:01:31,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 20:01:31,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:01:31,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 20:01:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:31,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:31,837 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 20:01:31,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 20:01:31,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 20:01:31,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 20:01:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:01:31,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:32,127 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_339 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2022-12-13 20:01:32,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:01:32,238 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 139 [2022-12-13 20:01:32,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-13 20:01:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:01:32,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523504812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:01:32,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:01:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 28 [2022-12-13 20:01:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392932690] [2022-12-13 20:01:32,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 20:01:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:32,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 20:01:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=662, Unknown=1, NotChecked=54, Total=870 [2022-12-13 20:01:32,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 382 [2022-12-13 20:01:32,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 600 transitions, 9702 flow. Second operand has 30 states, 30 states have (on average 98.33333333333333) internal successors, (2950), 30 states have internal predecessors, (2950), 0 states have call successors, (0), 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-12-13 20:01:32,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:32,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 382 [2022-12-13 20:01:32,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:37,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:01:39,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:01:43,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:01:47,437 INFO L130 PetriNetUnfolder]: 5841/9884 cut-off events. [2022-12-13 20:01:47,437 INFO L131 PetriNetUnfolder]: For 560489/560489 co-relation queries the response was YES. [2022-12-13 20:01:47,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122534 conditions, 9884 events. 5841/9884 cut-off events. For 560489/560489 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 67668 event pairs, 485 based on Foata normal form. 4/9888 useless extension candidates. Maximal degree in co-relation 122387. Up to 5900 conditions per place. [2022-12-13 20:01:47,578 INFO L137 encePairwiseOnDemand]: 370/382 looper letters, 519 selfloop transitions, 342 changer transitions 17/878 dead transitions. [2022-12-13 20:01:47,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 878 transitions, 17653 flow [2022-12-13 20:01:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 20:01:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 20:01:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2668 transitions. [2022-12-13 20:01:47,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2686266612968184 [2022-12-13 20:01:47,583 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2668 transitions. [2022-12-13 20:01:47,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2668 transitions. [2022-12-13 20:01:47,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:47,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2668 transitions. [2022-12-13 20:01:47,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 102.61538461538461) internal successors, (2668), 26 states have internal predecessors, (2668), 0 states have call successors, (0), 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-12-13 20:01:47,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 382.0) internal successors, (10314), 27 states have internal predecessors, (10314), 0 states have call successors, (0), 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-12-13 20:01:47,595 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 382.0) internal successors, (10314), 27 states have internal predecessors, (10314), 0 states have call successors, (0), 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-12-13 20:01:47,595 INFO L175 Difference]: Start difference. First operand has 384 places, 600 transitions, 9702 flow. Second operand 26 states and 2668 transitions. [2022-12-13 20:01:47,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 878 transitions, 17653 flow [2022-12-13 20:01:50,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 878 transitions, 15207 flow, removed 963 selfloop flow, removed 66 redundant places. [2022-12-13 20:01:50,116 INFO L231 Difference]: Finished difference. Result has 298 places, 737 transitions, 12444 flow [2022-12-13 20:01:50,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=8442, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12444, PETRI_PLACES=298, PETRI_TRANSITIONS=737} [2022-12-13 20:01:50,117 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 273 predicate places. [2022-12-13 20:01:50,117 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 737 transitions, 12444 flow [2022-12-13 20:01:50,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.33333333333333) internal successors, (2950), 30 states have internal predecessors, (2950), 0 states have call successors, (0), 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-12-13 20:01:50,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:50,117 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:50,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:01:50,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:50,319 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:01:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -29375687, now seen corresponding path program 6 times [2022-12-13 20:01:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:50,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955864199] [2022-12-13 20:01:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:01:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955864199] [2022-12-13 20:01:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955864199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:50,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74063995] [2022-12-13 20:01:50,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:01:50,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:50,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:01:50,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:01:50,731 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 20:01:50,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:01:50,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 20:01:50,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:01:50,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:01:50,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74063995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:01:50,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:01:50,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 20:01:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717942901] [2022-12-13 20:01:50,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 20:01:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 20:01:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:01:51,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 382 [2022-12-13 20:01:51,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 737 transitions, 12444 flow. Second operand has 16 states, 16 states have (on average 147.9375) internal successors, (2367), 16 states have internal predecessors, (2367), 0 states have call successors, (0), 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-12-13 20:01:51,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:51,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 382 [2022-12-13 20:01:51,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:54,450 INFO L130 PetriNetUnfolder]: 5070/8981 cut-off events. [2022-12-13 20:01:54,450 INFO L131 PetriNetUnfolder]: For 368958/368958 co-relation queries the response was YES. [2022-12-13 20:01:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99822 conditions, 8981 events. 5070/8981 cut-off events. For 368958/368958 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 64472 event pairs, 304 based on Foata normal form. 786/9767 useless extension candidates. Maximal degree in co-relation 99712. Up to 5801 conditions per place. [2022-12-13 20:01:54,534 INFO L137 encePairwiseOnDemand]: 371/382 looper letters, 249 selfloop transitions, 342 changer transitions 332/923 dead transitions. [2022-12-13 20:01:54,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 923 transitions, 19895 flow [2022-12-13 20:01:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 20:01:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 20:01:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3794 transitions. [2022-12-13 20:01:54,538 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39727748691099474 [2022-12-13 20:01:54,538 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3794 transitions. [2022-12-13 20:01:54,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3794 transitions. [2022-12-13 20:01:54,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:54,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3794 transitions. [2022-12-13 20:01:54,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.76) internal successors, (3794), 25 states have internal predecessors, (3794), 0 states have call successors, (0), 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-12-13 20:01:54,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 382.0) internal successors, (9932), 26 states have internal predecessors, (9932), 0 states have call successors, (0), 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-12-13 20:01:54,546 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 382.0) internal successors, (9932), 26 states have internal predecessors, (9932), 0 states have call successors, (0), 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-12-13 20:01:54,546 INFO L175 Difference]: Start difference. First operand has 298 places, 737 transitions, 12444 flow. Second operand 25 states and 3794 transitions. [2022-12-13 20:01:54,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 923 transitions, 19895 flow [2022-12-13 20:01:56,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 923 transitions, 16882 flow, removed 1004 selfloop flow, removed 28 redundant places. [2022-12-13 20:01:56,750 INFO L231 Difference]: Finished difference. Result has 287 places, 478 transitions, 9959 flow [2022-12-13 20:01:56,751 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=7301, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=9959, PETRI_PLACES=287, PETRI_TRANSITIONS=478} [2022-12-13 20:01:56,751 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 262 predicate places. [2022-12-13 20:01:56,751 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 478 transitions, 9959 flow [2022-12-13 20:01:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 147.9375) internal successors, (2367), 16 states have internal predecessors, (2367), 0 states have call successors, (0), 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-12-13 20:01:56,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:56,751 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:56,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 20:01:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:01:56,953 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:01:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash -619179168, now seen corresponding path program 7 times [2022-12-13 20:01:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:56,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996671715] [2022-12-13 20:01:56,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:01:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996671715] [2022-12-13 20:01:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996671715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787977268] [2022-12-13 20:01:58,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 20:01:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:58,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:01:58,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:01:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:58,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 20:01:58,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:58,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:58,656 INFO L350 Elim1Store]: Elim1 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-12-13 20:01:58,832 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 20:01:58,832 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 10 [2022-12-13 20:01:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 20:01:58,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:02:03,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:03,508 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 277 [2022-12-13 20:02:03,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:03,540 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 189 [2022-12-13 20:02:03,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:03,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 144 treesize of output 137 [2022-12-13 20:02:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 20:02:05,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787977268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:02:05,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:02:05,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-12-13 20:02:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361208465] [2022-12-13 20:02:05,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:02:05,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 20:02:05,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:02:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 20:02:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=768, Unknown=1, NotChecked=0, Total=930 [2022-12-13 20:02:06,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 382 [2022-12-13 20:02:06,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 478 transitions, 9959 flow. Second operand has 31 states, 31 states have (on average 94.2258064516129) internal successors, (2921), 31 states have internal predecessors, (2921), 0 states have call successors, (0), 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-12-13 20:02:06,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:02:06,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 382 [2022-12-13 20:02:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:02:15,441 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 100 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:02:17,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:02:21,395 INFO L130 PetriNetUnfolder]: 5682/9800 cut-off events. [2022-12-13 20:02:21,395 INFO L131 PetriNetUnfolder]: For 345720/345720 co-relation queries the response was YES. [2022-12-13 20:02:21,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110528 conditions, 9800 events. 5682/9800 cut-off events. For 345720/345720 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 68932 event pairs, 401 based on Foata normal form. 11/9811 useless extension candidates. Maximal degree in co-relation 110423. Up to 6233 conditions per place. [2022-12-13 20:02:21,554 INFO L137 encePairwiseOnDemand]: 367/382 looper letters, 507 selfloop transitions, 403 changer transitions 38/948 dead transitions. [2022-12-13 20:02:21,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 948 transitions, 23051 flow [2022-12-13 20:02:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 20:02:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 20:02:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2456 transitions. [2022-12-13 20:02:21,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.25717277486910994 [2022-12-13 20:02:21,557 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2456 transitions. [2022-12-13 20:02:21,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2456 transitions. [2022-12-13 20:02:21,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:02:21,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2456 transitions. [2022-12-13 20:02:21,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 98.24) internal successors, (2456), 25 states have internal predecessors, (2456), 0 states have call successors, (0), 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-12-13 20:02:21,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 382.0) internal successors, (9932), 26 states have internal predecessors, (9932), 0 states have call successors, (0), 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-12-13 20:02:21,564 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 382.0) internal successors, (9932), 26 states have internal predecessors, (9932), 0 states have call successors, (0), 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-12-13 20:02:21,564 INFO L175 Difference]: Start difference. First operand has 287 places, 478 transitions, 9959 flow. Second operand 25 states and 2456 transitions. [2022-12-13 20:02:21,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 948 transitions, 23051 flow [2022-12-13 20:02:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 948 transitions, 19721 flow, removed 1631 selfloop flow, removed 32 redundant places. [2022-12-13 20:02:23,694 INFO L231 Difference]: Finished difference. Result has 209 places, 631 transitions, 12751 flow [2022-12-13 20:02:23,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=8775, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=12751, PETRI_PLACES=209, PETRI_TRANSITIONS=631} [2022-12-13 20:02:23,694 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 184 predicate places. [2022-12-13 20:02:23,694 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 631 transitions, 12751 flow [2022-12-13 20:02:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 94.2258064516129) internal successors, (2921), 31 states have internal predecessors, (2921), 0 states have call successors, (0), 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-12-13 20:02:23,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:02:23,695 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:02:23,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 20:02:23,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 20:02:23,896 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:02:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:02:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash -912263330, now seen corresponding path program 8 times [2022-12-13 20:02:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:02:23,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959784476] [2022-12-13 20:02:23,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:02:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:02:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:02:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:02:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:02:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959784476] [2022-12-13 20:02:25,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959784476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:02:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73845562] [2022-12-13 20:02:25,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:02:25,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:02:25,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:02:25,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:02:25,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:02:25,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:02:25,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:02:25,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 20:02:25,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:02:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:02:25,572 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 20:02:25,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 20:02:25,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 20:02:25,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 20:02:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:02:25,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:02:26,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:26,057 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 139 [2022-12-13 20:02:26,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-13 20:02:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 20:02:26,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73845562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:02:26,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:02:26,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 30 [2022-12-13 20:02:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866470085] [2022-12-13 20:02:26,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:02:26,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 20:02:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:02:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 20:02:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-12-13 20:02:28,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:31,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:31,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 382 [2022-12-13 20:02:31,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 631 transitions, 12751 flow. Second operand has 32 states, 32 states have (on average 100.25) internal successors, (3208), 32 states have internal predecessors, (3208), 0 states have call successors, (0), 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-12-13 20:02:31,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:02:31,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 382 [2022-12-13 20:02:31,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:02:35,834 INFO L130 PetriNetUnfolder]: 6560/11305 cut-off events. [2022-12-13 20:02:35,834 INFO L131 PetriNetUnfolder]: For 238478/238478 co-relation queries the response was YES. [2022-12-13 20:02:35,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109695 conditions, 11305 events. 6560/11305 cut-off events. For 238478/238478 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 80799 event pairs, 575 based on Foata normal form. 11/11316 useless extension candidates. Maximal degree in co-relation 109607. Up to 7163 conditions per place. [2022-12-13 20:02:35,928 INFO L137 encePairwiseOnDemand]: 370/382 looper letters, 508 selfloop transitions, 413 changer transitions 36/957 dead transitions. [2022-12-13 20:02:35,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 957 transitions, 21079 flow [2022-12-13 20:02:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:02:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 20:02:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2195 transitions. [2022-12-13 20:02:35,931 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2736225380204438 [2022-12-13 20:02:35,931 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2195 transitions. [2022-12-13 20:02:35,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2195 transitions. [2022-12-13 20:02:35,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:02:35,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2195 transitions. [2022-12-13 20:02:35,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 104.52380952380952) internal successors, (2195), 21 states have internal predecessors, (2195), 0 states have call successors, (0), 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-12-13 20:02:35,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 382.0) internal successors, (8404), 22 states have internal predecessors, (8404), 0 states have call successors, (0), 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-12-13 20:02:35,937 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 382.0) internal successors, (8404), 22 states have internal predecessors, (8404), 0 states have call successors, (0), 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-12-13 20:02:35,937 INFO L175 Difference]: Start difference. First operand has 209 places, 631 transitions, 12751 flow. Second operand 21 states and 2195 transitions. [2022-12-13 20:02:35,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 957 transitions, 21079 flow [2022-12-13 20:02:37,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 957 transitions, 20823 flow, removed 123 selfloop flow, removed 6 redundant places. [2022-12-13 20:02:37,087 INFO L231 Difference]: Finished difference. Result has 224 places, 714 transitions, 15383 flow [2022-12-13 20:02:37,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=12607, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=15383, PETRI_PLACES=224, PETRI_TRANSITIONS=714} [2022-12-13 20:02:37,087 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 199 predicate places. [2022-12-13 20:02:37,088 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 714 transitions, 15383 flow [2022-12-13 20:02:37,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 100.25) internal successors, (3208), 32 states have internal predecessors, (3208), 0 states have call successors, (0), 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-12-13 20:02:37,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:02:37,088 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:02:37,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 20:02:37,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 20:02:37,289 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:02:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:02:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1071263292, now seen corresponding path program 9 times [2022-12-13 20:02:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:02:37,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5468706] [2022-12-13 20:02:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:02:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:02:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:02:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:02:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:02:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5468706] [2022-12-13 20:02:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5468706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:02:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874402412] [2022-12-13 20:02:37,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:02:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:02:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:02:37,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:02:37,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:02:37,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 20:02:37,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:02:37,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 20:02:37,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:02:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:02:37,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:02:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:02:37,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874402412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:02:37,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:02:37,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 20:02:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182253103] [2022-12-13 20:02:37,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:02:37,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 20:02:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:02:37,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 20:02:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:02:38,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 382 [2022-12-13 20:02:38,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 714 transitions, 15383 flow. Second operand has 15 states, 15 states have (on average 157.26666666666668) internal successors, (2359), 15 states have internal predecessors, (2359), 0 states have call successors, (0), 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-12-13 20:02:38,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:02:38,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 382 [2022-12-13 20:02:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:02:41,028 INFO L130 PetriNetUnfolder]: 5753/10409 cut-off events. [2022-12-13 20:02:41,028 INFO L131 PetriNetUnfolder]: For 253719/253835 co-relation queries the response was YES. [2022-12-13 20:02:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100781 conditions, 10409 events. 5753/10409 cut-off events. For 253719/253835 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 77954 event pairs, 870 based on Foata normal form. 210/10539 useless extension candidates. Maximal degree in co-relation 100692. Up to 6544 conditions per place. [2022-12-13 20:02:41,133 INFO L137 encePairwiseOnDemand]: 374/382 looper letters, 534 selfloop transitions, 62 changer transitions 160/801 dead transitions. [2022-12-13 20:02:41,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 801 transitions, 18465 flow [2022-12-13 20:02:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:02:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:02:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1442 transitions. [2022-12-13 20:02:41,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41942990110529377 [2022-12-13 20:02:41,136 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1442 transitions. [2022-12-13 20:02:41,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1442 transitions. [2022-12-13 20:02:41,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:02:41,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1442 transitions. [2022-12-13 20:02:41,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.22222222222223) internal successors, (1442), 9 states have internal predecessors, (1442), 0 states have call successors, (0), 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-12-13 20:02:41,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 382.0) internal successors, (3820), 10 states have internal predecessors, (3820), 0 states have call successors, (0), 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-12-13 20:02:41,154 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 382.0) internal successors, (3820), 10 states have internal predecessors, (3820), 0 states have call successors, (0), 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-12-13 20:02:41,154 INFO L175 Difference]: Start difference. First operand has 224 places, 714 transitions, 15383 flow. Second operand 9 states and 1442 transitions. [2022-12-13 20:02:41,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 801 transitions, 18465 flow [2022-12-13 20:02:42,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 801 transitions, 17981 flow, removed 84 selfloop flow, removed 13 redundant places. [2022-12-13 20:02:42,458 INFO L231 Difference]: Finished difference. Result has 220 places, 607 transitions, 12861 flow [2022-12-13 20:02:42,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=13545, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12861, PETRI_PLACES=220, PETRI_TRANSITIONS=607} [2022-12-13 20:02:42,459 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 195 predicate places. [2022-12-13 20:02:42,459 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 607 transitions, 12861 flow [2022-12-13 20:02:42,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 157.26666666666668) internal successors, (2359), 15 states have internal predecessors, (2359), 0 states have call successors, (0), 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-12-13 20:02:42,459 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:02:42,460 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:02:42,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 20:02:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:02:42,661 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 20:02:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:02:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash 656590288, now seen corresponding path program 10 times [2022-12-13 20:02:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:02:42,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329977016] [2022-12-13 20:02:42,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:02:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:02:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:02:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:02:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:02:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329977016] [2022-12-13 20:02:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329977016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:02:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31648931] [2022-12-13 20:02:44,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:02:44,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:02:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:02:44,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:02:44,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27372086-1f79-4d49-9d4b-8f5c33f3b2f6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:02:44,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:02:44,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:02:44,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 20:02:44,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:02:44,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:02:44,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:02:44,125 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:02:44,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 20:02:44,230 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-12-13 20:02:44,277 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:02:44,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-13 20:02:44,312 INFO L350 Elim1Store]: Elim1 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-12-13 20:02:44,328 INFO L350 Elim1Store]: Elim1 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-12-13 20:02:44,363 INFO L350 Elim1Store]: Elim1 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-12-13 20:02:44,404 INFO L350 Elim1Store]: Elim1 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-12-13 20:02:46,527 INFO L321 Elim1Store]: treesize reduction 291, result has 59.4 percent of original size [2022-12-13 20:02:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 199 treesize of output 506 [2022-12-13 20:02:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:02:46,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:02:49,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:49,564 INFO L350 Elim1Store]: Elim1 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 250 treesize of output 166 [2022-12-13 20:02:49,818 INFO L321 Elim1Store]: treesize reduction 24, result has 89.6 percent of original size [2022-12-13 20:02:49,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56463 treesize of output 52405 [2022-12-13 20:02:50,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:50,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 52199 treesize of output 39581 [2022-12-13 20:02:50,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:50,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 39399 treesize of output 33181 [2022-12-13 20:02:50,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:02:50,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:02:50,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 32426 treesize of output 29408