./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/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 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --- 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:45:47,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:45:47,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:45:47,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:45:47,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:45:47,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:45:47,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:45:47,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:45:47,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:45:47,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:45:47,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:45:47,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:45:47,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:45:47,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:45:47,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:45:47,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:45:47,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:45:47,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:45:47,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:45:47,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:45:47,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:45:47,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:45:47,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:45:47,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:45:47,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:45:47,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:45:47,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:45:47,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:45:47,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:45:47,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:45:47,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:45:47,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:45:47,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:45:47,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:45:47,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:45:47,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:45:47,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:45:47,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:45:47,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:45:47,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:45:47,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:45:47,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:45:47,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:45:47,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:45:47,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:45:47,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:45:47,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:45:47,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:45:47,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:45:47,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:45:47,809 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:45:47,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:45:47,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:45:47,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:45:47,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:45:47,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:45:47,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:45:47,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:45:47,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:45:47,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:45:47,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:45:47,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:45:47,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:45:47,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:45:47,813 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:45:47,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:45:47,813 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:45:47,813 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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f [2022-12-13 19:45:47,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:45:47,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:45:48,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:45:48,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:45:48,002 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:45:48,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-12-13 19:45:50,570 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:45:50,723 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:45:50,724 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-12-13 19:45:50,728 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/data/48a06f76c/cfa2abfa558d41aea1432003fe50de32/FLAG819077625 [2022-12-13 19:45:51,146 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/data/48a06f76c/cfa2abfa558d41aea1432003fe50de32 [2022-12-13 19:45:51,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:45:51,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:45:51,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:45:51,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:45:51,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:45:51,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed51be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51, skipping insertion in model container [2022-12-13 19:45:51,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:45:51,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:45:51,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:51,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:51,293 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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-12-13 19:45:51,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:45:51,307 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:45:51,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:51,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:51,324 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_500daae5-25d1-484b-b6a4-1d7e72c88ca9/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-12-13 19:45:51,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:45:51,337 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:45:51,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51 WrapperNode [2022-12-13 19:45:51,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:45:51,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:45:51,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:45:51,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:45:51,343 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:45:51" (1/1) ... [2022-12-13 19:45:51,349 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:45:51" (1/1) ... [2022-12-13 19:45:51,368 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 225 [2022-12-13 19:45:51,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:45:51,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:45:51,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:45:51,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:45:51,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,389 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:45:51,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:45:51,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:45:51,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:45:51,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (1/1) ... [2022-12-13 19:45:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:45:51,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:45:51,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:45:51,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:45:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 19:45:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 19:45:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 19:45:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:45:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:45:51,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:45:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:45:51,454 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:45:51,539 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:45:51,541 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:45:51,834 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:45:51,968 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:45:51,969 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 19:45:51,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:51 BoogieIcfgContainer [2022-12-13 19:45:51,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:45:51,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:45:51,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:45:51,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:45:51,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:45:51" (1/3) ... [2022-12-13 19:45:51,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ee39fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:51, skipping insertion in model container [2022-12-13 19:45:51,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:51" (2/3) ... [2022-12-13 19:45:51,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ee39fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:51, skipping insertion in model container [2022-12-13 19:45:51,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:51" (3/3) ... [2022-12-13 19:45:51,979 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-12-13 19:45:51,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:45:51,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:45:51,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:45:51,992 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:45:52,050 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 19:45:52,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 227 transitions, 478 flow [2022-12-13 19:45:52,150 INFO L130 PetriNetUnfolder]: 18/224 cut-off events. [2022-12-13 19:45:52,150 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 19:45:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 224 events. 18/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-12-13 19:45:52,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 227 transitions, 478 flow [2022-12-13 19:45:52,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 213 transitions, 444 flow [2022-12-13 19:45:52,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:45:52,170 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 213 transitions, 444 flow [2022-12-13 19:45:52,172 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 213 transitions, 444 flow [2022-12-13 19:45:52,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 213 transitions, 444 flow [2022-12-13 19:45:52,203 INFO L130 PetriNetUnfolder]: 18/213 cut-off events. [2022-12-13 19:45:52,203 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 19:45:52,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 18/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 325 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-12-13 19:45:52,207 INFO L119 LiptonReduction]: Number of co-enabled transitions 8736 [2022-12-13 19:45:57,703 INFO L134 LiptonReduction]: Checked pairs total: 8753 [2022-12-13 19:45:57,703 INFO L136 LiptonReduction]: Total number of compositions: 240 [2022-12-13 19:45:57,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:45:57,721 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;@c75cdce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:45:57,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 19:45:57,728 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 19:45:57,728 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 19:45:57,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:57,729 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] [2022-12-13 19:45:57,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:45:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 800551407, now seen corresponding path program 1 times [2022-12-13 19:45:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:57,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575609686] [2022-12-13 19:45:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:58,207 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:45:58,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575609686] [2022-12-13 19:45:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575609686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:58,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:45:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239275794] [2022-12-13 19:45:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:58,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:45:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:58,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:45:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:45:58,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 467 [2022-12-13 19:45:58,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 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:45:58,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:58,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 467 [2022-12-13 19:45:58,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:58,415 INFO L130 PetriNetUnfolder]: 420/591 cut-off events. [2022-12-13 19:45:58,415 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 19:45:58,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 591 events. 420/591 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1988 event pairs, 213 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 992. Up to 575 conditions per place. [2022-12-13 19:45:58,419 INFO L137 encePairwiseOnDemand]: 462/467 looper letters, 22 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-13 19:45:58,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 120 flow [2022-12-13 19:45:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:45:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:45:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2022-12-13 19:45:58,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44967880085653106 [2022-12-13 19:45:58,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2022-12-13 19:45:58,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2022-12-13 19:45:58,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:58,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2022-12-13 19:45:58,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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:45:58,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 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:45:58,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 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:45:58,448 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 630 transitions. [2022-12-13 19:45:58,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 120 flow [2022-12-13 19:45:58,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 19:45:58,454 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 70 flow [2022-12-13 19:45:58,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2022-12-13 19:45:58,459 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-13 19:45:58,460 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 70 flow [2022-12-13 19:45:58,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 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:45:58,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:58,461 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:45:58,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:45:58,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:45:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1265875044, now seen corresponding path program 1 times [2022-12-13 19:45:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:58,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524648780] [2022-12-13 19:45:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:58,597 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:45:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:58,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524648780] [2022-12-13 19:45:58,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524648780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:45:58,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231737742] [2022-12-13 19:45:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:45:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:45:58,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:45:58,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:45:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:58,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:45:58,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:45:58,724 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:45:58,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:45:58,752 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:45:58,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231737742] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 19:45:58,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:45:58,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-13 19:45:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284211942] [2022-12-13 19:45:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:45:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:45:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:45:58,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 467 [2022-12-13 19:45:58,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 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:45:58,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:58,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 467 [2022-12-13 19:45:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:58,990 INFO L130 PetriNetUnfolder]: 499/704 cut-off events. [2022-12-13 19:45:58,990 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 19:45:58,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 704 events. 499/704 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2558 event pairs, 167 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1421. Up to 410 conditions per place. [2022-12-13 19:45:58,995 INFO L137 encePairwiseOnDemand]: 461/467 looper letters, 31 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2022-12-13 19:45:58,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 166 flow [2022-12-13 19:45:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:45:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:45:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1012 transitions. [2022-12-13 19:45:59,000 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4334047109207709 [2022-12-13 19:45:59,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1012 transitions. [2022-12-13 19:45:59,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1012 transitions. [2022-12-13 19:45:59,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:59,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1012 transitions. [2022-12-13 19:45:59,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 0 states have call successors, (0), 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:45:59,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 467.0) internal successors, (2802), 6 states have internal predecessors, (2802), 0 states have call successors, (0), 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:45:59,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 467.0) internal successors, (2802), 6 states have internal predecessors, (2802), 0 states have call successors, (0), 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:45:59,011 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 70 flow. Second operand 5 states and 1012 transitions. [2022-12-13 19:45:59,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 166 flow [2022-12-13 19:45:59,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 19:45:59,013 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 89 flow [2022-12-13 19:45:59,013 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-13 19:45:59,013 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-13 19:45:59,014 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 89 flow [2022-12-13 19:45:59,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 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:45:59,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:59,015 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, 1] [2022-12-13 19:45:59,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:45:59,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:45:59,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:45:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 394868204, now seen corresponding path program 1 times [2022-12-13 19:45:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818532578] [2022-12-13 19:45:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818532578] [2022-12-13 19:45:59,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818532578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:45:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072239028] [2022-12-13 19:45:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:45:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:45:59,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:45:59,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:45:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:59,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:45:59,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:45:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:59,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:45:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:59,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072239028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:45:59,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:45:59,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-13 19:45:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412684058] [2022-12-13 19:45:59,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:45:59,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:45:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:45:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:45:59,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 467 [2022-12-13 19:45:59,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 89 flow. Second operand has 14 states, 14 states have (on average 191.57142857142858) internal successors, (2682), 14 states have internal predecessors, (2682), 0 states have call successors, (0), 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:45:59,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:59,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 467 [2022-12-13 19:45:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:46:00,372 INFO L130 PetriNetUnfolder]: 826/1206 cut-off events. [2022-12-13 19:46:00,373 INFO L131 PetriNetUnfolder]: For 591/735 co-relation queries the response was YES. [2022-12-13 19:46:00,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1206 events. 826/1206 cut-off events. For 591/735 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4753 event pairs, 183 based on Foata normal form. 144/1178 useless extension candidates. Maximal degree in co-relation 2882. Up to 410 conditions per place. [2022-12-13 19:46:00,379 INFO L137 encePairwiseOnDemand]: 457/467 looper letters, 101 selfloop transitions, 22 changer transitions 0/124 dead transitions. [2022-12-13 19:46:00,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 124 transitions, 639 flow [2022-12-13 19:46:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:46:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 19:46:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2576 transitions. [2022-12-13 19:46:00,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42431230439795753 [2022-12-13 19:46:00,387 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2576 transitions. [2022-12-13 19:46:00,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2576 transitions. [2022-12-13 19:46:00,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:46:00,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2576 transitions. [2022-12-13 19:46:00,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 198.15384615384616) internal successors, (2576), 13 states have internal predecessors, (2576), 0 states have call successors, (0), 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:46:00,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:46:00,409 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:46:00,409 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 89 flow. Second operand 13 states and 2576 transitions. [2022-12-13 19:46:00,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 124 transitions, 639 flow [2022-12-13 19:46:00,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 124 transitions, 617 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:46:00,412 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 222 flow [2022-12-13 19:46:00,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-13 19:46:00,413 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2022-12-13 19:46:00,413 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 222 flow [2022-12-13 19:46:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 191.57142857142858) internal successors, (2682), 14 states have internal predecessors, (2682), 0 states have call successors, (0), 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:46:00,415 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:46:00,415 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, 1, 1] [2022-12-13 19:46:00,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:46:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 19:46:00,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:46:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:46:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -530985732, now seen corresponding path program 1 times [2022-12-13 19:46:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:46:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397166782] [2022-12-13 19:46:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:46:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:46:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:46:02,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397166782] [2022-12-13 19:46:02,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397166782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:46:02,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954141118] [2022-12-13 19:46:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:02,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:02,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:46:02,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:46:02,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:46:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:46:02,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 19:46:02,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:46:02,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:46:02,322 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 14 treesize of output 12 [2022-12-13 19:46:02,382 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:46:02,442 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:46:02,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 19:46:02,688 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 20 treesize of output 22 [2022-12-13 19:46:02,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:46:02,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:02,948 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 94 treesize of output 53 [2022-12-13 19:46:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:03,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:46:03,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse0 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0))) (and (or (not .cse0) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648))) (and (forall ((v_ArrVal_160 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) .cse1) c_~mts2~0) 0)) (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse2 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) .cse1)))) (or (= .cse2 0) (< .cse2 0)))))) (or (let ((.cse3 (+ c_~sum~0 c_~mts2~0)) (.cse6 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (or (< c_~mts3~0 .cse3) (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse5 .cse1)))) (or (< .cse4 0) (= (+ (select .cse5 .cse6) c_~mts1~0) .cse4)))))) (or (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse1))) (or (< (+ c_~mts3~0 .cse7) 0) (= (+ (select .cse8 .cse6) c_~mts1~0) (+ c_~sum~0 .cse7 c_~mts2~0)))))) (<= .cse3 c_~mts3~0)) (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse10 (select .cse9 .cse1))) (or (= (+ (select .cse9 .cse6) c_~mts1~0) 0) (not (< (+ c_~mts3~0 .cse10) 0)) (< 0 (+ c_~sum~0 .cse10 c_~mts2~0)))))) (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse1))) (let ((.cse11 (+ c_~sum~0 .cse13 c_~mts2~0))) (or (<= .cse11 0) (= (+ (select .cse12 .cse6) c_~mts1~0) .cse11) (not (< (+ c_~mts3~0 .cse13) 0))))))))) .cse0 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647))))) is different from false [2022-12-13 19:46:03,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (not .cse0) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648))) (and (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) .cse1) c_~mts2~0) 0)) (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse2 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) .cse1)))) (or (= .cse2 0) (< .cse2 0)))))) (or .cse0 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647)) (let ((.cse5 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse11 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse6 (select .cse4 .cse1))) (let ((.cse3 (+ c_~sum~0 .cse6 c_~mts2~0))) (or (<= .cse3 0) (= (+ (select .cse4 .cse5) c_~mts1~0) .cse3) (not (< (+ c_~mts3~0 .cse6) 0))))))) (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse1))) (or (not (< (+ c_~mts3~0 .cse7) 0)) (< 0 (+ c_~sum~0 .cse7 c_~mts2~0)) (= (+ (select .cse8 .cse5) c_~mts1~0) 0))))) (or (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse10 (+ c_~mts3~0 (select .cse9 .cse1)))) (or (= (+ (select .cse9 .cse5) c_~mts1~0) .cse10) (< .cse10 0))))) (< c_~mts3~0 .cse11)) (or (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse1))) (or (= (+ (select .cse12 .cse5) c_~mts1~0) (+ c_~sum~0 .cse13 c_~mts2~0)) (< (+ c_~mts3~0 .cse13) 0))))) (<= .cse11 c_~mts3~0))))))) is different from false [2022-12-13 19:46:20,010 WARN L233 SmtUtils]: Spent 15.05s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:46:20,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:20,102 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 145 treesize of output 97 [2022-12-13 19:46:20,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:20,121 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 780 treesize of output 742 [2022-12-13 19:46:20,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:20,143 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 687 treesize of output 641 [2022-12-13 19:46:20,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:20,166 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 631 treesize of output 529 [2022-12-13 19:46:20,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:20,191 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 308 treesize of output 286 [2022-12-13 19:46:21,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:21,578 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 146 treesize of output 98 [2022-12-13 19:46:21,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:21,600 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 796 treesize of output 758 [2022-12-13 19:46:21,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:21,623 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 703 treesize of output 601 [2022-12-13 19:46:21,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:21,647 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 591 treesize of output 545 [2022-12-13 19:46:21,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:21,679 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 570 treesize of output 548 [2022-12-13 19:46:23,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:23,158 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 182 treesize of output 122 [2022-12-13 19:46:23,183 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:23,184 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 1158 treesize of output 1098 [2022-12-13 19:46:23,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:46:23,208 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 1043 treesize of output 951 [2022-12-13 19:46:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:46:23,232 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 951 treesize of output 767 [2022-12-13 19:46:23,254 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:23,255 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 802 treesize of output 762 [2022-12-13 19:46:23,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:23,745 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 120 treesize of output 84 [2022-12-13 19:46:23,766 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:23,766 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 717 treesize of output 681 [2022-12-13 19:46:23,790 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:23,791 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 677 treesize of output 653 [2022-12-13 19:46:23,812 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 603 treesize of output 507 [2022-12-13 19:46:23,827 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 507 treesize of output 459 [2022-12-13 19:46:24,846 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:46:24,847 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 87 treesize of output 1 [2022-12-13 19:46:24,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:24,859 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 150 treesize of output 102 [2022-12-13 19:46:24,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:46:24,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:46:24,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:24,877 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 150 treesize of output 126 [2022-12-13 19:46:24,893 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:46:24,893 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 91 treesize of output 77 [2022-12-13 19:46:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:25,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954141118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:46:25,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:46:25,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 19:46:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019285841] [2022-12-13 19:46:25,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:46:25,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 19:46:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:46:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 19:46:25,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=743, Unknown=3, NotChecked=114, Total=992 [2022-12-13 19:46:25,743 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 467 [2022-12-13 19:46:25,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 222 flow. Second operand has 32 states, 32 states have (on average 138.15625) internal successors, (4421), 32 states have internal predecessors, (4421), 0 states have call successors, (0), 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:46:25,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:46:25,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 467 [2022-12-13 19:46:25,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:46:28,545 INFO L130 PetriNetUnfolder]: 1658/2441 cut-off events. [2022-12-13 19:46:28,545 INFO L131 PetriNetUnfolder]: For 3571/3715 co-relation queries the response was YES. [2022-12-13 19:46:28,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 2441 events. 1658/2441 cut-off events. For 3571/3715 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11256 event pairs, 163 based on Foata normal form. 146/2585 useless extension candidates. Maximal degree in co-relation 7637. Up to 1485 conditions per place. [2022-12-13 19:46:28,555 INFO L137 encePairwiseOnDemand]: 454/467 looper letters, 137 selfloop transitions, 63 changer transitions 4/206 dead transitions. [2022-12-13 19:46:28,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 206 transitions, 1345 flow [2022-12-13 19:46:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:46:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 19:46:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1913 transitions. [2022-12-13 19:46:28,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3151045956185142 [2022-12-13 19:46:28,560 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1913 transitions. [2022-12-13 19:46:28,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1913 transitions. [2022-12-13 19:46:28,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:46:28,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1913 transitions. [2022-12-13 19:46:28,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 147.15384615384616) internal successors, (1913), 13 states have internal predecessors, (1913), 0 states have call successors, (0), 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:46:28,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:46:28,581 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:46:28,581 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 222 flow. Second operand 13 states and 1913 transitions. [2022-12-13 19:46:28,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 206 transitions, 1345 flow [2022-12-13 19:46:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 206 transitions, 1284 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-13 19:46:28,599 INFO L231 Difference]: Finished difference. Result has 67 places, 108 transitions, 712 flow [2022-12-13 19:46:28,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=712, PETRI_PLACES=67, PETRI_TRANSITIONS=108} [2022-12-13 19:46:28,600 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-13 19:46:28,600 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 108 transitions, 712 flow [2022-12-13 19:46:28,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 138.15625) internal successors, (4421), 32 states have internal predecessors, (4421), 0 states have call successors, (0), 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:46:28,601 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:46:28,602 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, 1, 1] [2022-12-13 19:46:28,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:46:28,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:28,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:46:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:46:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1279687430, now seen corresponding path program 2 times [2022-12-13 19:46:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:46:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119926754] [2022-12-13 19:46:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:46:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:46:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:46:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119926754] [2022-12-13 19:46:30,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119926754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:46:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554889553] [2022-12-13 19:46:30,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:46:30,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:30,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:46:30,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:46:30,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:46:30,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:46:30,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:46:30,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 19:46:30,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:46:30,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:46:30,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:30,875 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 94 treesize of output 53 [2022-12-13 19:46:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:30,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:46:31,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:31,502 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 186 treesize of output 94 [2022-12-13 19:46:31,568 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:46:31,568 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 72 treesize of output 1 [2022-12-13 19:46:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:31,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554889553] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:46:31,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:46:31,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-12-13 19:46:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449575666] [2022-12-13 19:46:31,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:46:31,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 19:46:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:46:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 19:46:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2022-12-13 19:46:34,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 467 [2022-12-13 19:46:34,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 108 transitions, 712 flow. Second operand has 29 states, 29 states have (on average 172.48275862068965) internal successors, (5002), 29 states have internal predecessors, (5002), 0 states have call successors, (0), 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:46:34,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:46:34,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 467 [2022-12-13 19:46:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:46:36,567 INFO L130 PetriNetUnfolder]: 2147/3160 cut-off events. [2022-12-13 19:46:36,567 INFO L131 PetriNetUnfolder]: For 8495/8495 co-relation queries the response was YES. [2022-12-13 19:46:36,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12748 conditions, 3160 events. 2147/3160 cut-off events. For 8495/8495 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14152 event pairs, 565 based on Foata normal form. 24/3184 useless extension candidates. Maximal degree in co-relation 12128. Up to 2357 conditions per place. [2022-12-13 19:46:36,581 INFO L137 encePairwiseOnDemand]: 453/467 looper letters, 159 selfloop transitions, 86 changer transitions 7/252 dead transitions. [2022-12-13 19:46:36,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 252 transitions, 1925 flow [2022-12-13 19:46:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 19:46:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 19:46:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4263 transitions. [2022-12-13 19:46:36,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38035331905781583 [2022-12-13 19:46:36,594 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4263 transitions. [2022-12-13 19:46:36,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4263 transitions. [2022-12-13 19:46:36,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:46:36,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4263 transitions. [2022-12-13 19:46:36,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 177.625) internal successors, (4263), 24 states have internal predecessors, (4263), 0 states have call successors, (0), 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:46:36,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 467.0) internal successors, (11675), 25 states have internal predecessors, (11675), 0 states have call successors, (0), 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:46:36,611 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 467.0) internal successors, (11675), 25 states have internal predecessors, (11675), 0 states have call successors, (0), 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:46:36,611 INFO L175 Difference]: Start difference. First operand has 67 places, 108 transitions, 712 flow. Second operand 24 states and 4263 transitions. [2022-12-13 19:46:36,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 252 transitions, 1925 flow [2022-12-13 19:46:36,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 252 transitions, 1891 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 19:46:36,627 INFO L231 Difference]: Finished difference. Result has 103 places, 160 transitions, 1349 flow [2022-12-13 19:46:36,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1349, PETRI_PLACES=103, PETRI_TRANSITIONS=160} [2022-12-13 19:46:36,627 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2022-12-13 19:46:36,627 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 160 transitions, 1349 flow [2022-12-13 19:46:36,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 172.48275862068965) internal successors, (5002), 29 states have internal predecessors, (5002), 0 states have call successors, (0), 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:46:36,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:46:36,629 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, 1, 1] [2022-12-13 19:46:36,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:46:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:36,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:46:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:46:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2088024298, now seen corresponding path program 3 times [2022-12-13 19:46:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:46:36,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758289051] [2022-12-13 19:46:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:46:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:46:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:46:37,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758289051] [2022-12-13 19:46:37,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758289051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:46:37,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313745120] [2022-12-13 19:46:37,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:46:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:46:37,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:46:37,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:46:38,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 19:46:38,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:46:38,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 19:46:38,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:46:38,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:46:38,342 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 51 treesize of output 45 [2022-12-13 19:46:38,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:38,547 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 88 treesize of output 54 [2022-12-13 19:46:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:46:38,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:46:39,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:39,709 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 211 treesize of output 167 [2022-12-13 19:46:39,714 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 141 treesize of output 135 [2022-12-13 19:46:39,718 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 135 treesize of output 123 [2022-12-13 19:46:39,723 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 123 treesize of output 111 [2022-12-13 19:46:39,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:46:39,790 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 19:46:39,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 68 [2022-12-13 19:46:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:46:39,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313745120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:46:39,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:46:39,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 19:46:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294630534] [2022-12-13 19:46:39,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:46:39,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 19:46:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:46:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 19:46:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=780, Unknown=3, NotChecked=0, Total=930 [2022-12-13 19:46:43,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 467 [2022-12-13 19:46:43,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 160 transitions, 1349 flow. Second operand has 31 states, 31 states have (on average 141.32258064516128) internal successors, (4381), 31 states have internal predecessors, (4381), 0 states have call successors, (0), 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:46:43,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:46:43,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 467 [2022-12-13 19:46:43,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:46:48,291 INFO L130 PetriNetUnfolder]: 4496/6570 cut-off events. [2022-12-13 19:46:48,292 INFO L131 PetriNetUnfolder]: For 30235/30235 co-relation queries the response was YES. [2022-12-13 19:46:48,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31525 conditions, 6570 events. 4496/6570 cut-off events. For 30235/30235 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 33833 event pairs, 310 based on Foata normal form. 4/6574 useless extension candidates. Maximal degree in co-relation 31330. Up to 3246 conditions per place. [2022-12-13 19:46:48,325 INFO L137 encePairwiseOnDemand]: 452/467 looper letters, 314 selfloop transitions, 264 changer transitions 6/584 dead transitions. [2022-12-13 19:46:48,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 584 transitions, 5351 flow [2022-12-13 19:46:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 19:46:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 19:46:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5367 transitions. [2022-12-13 19:46:48,332 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3192362598144183 [2022-12-13 19:46:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5367 transitions. [2022-12-13 19:46:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5367 transitions. [2022-12-13 19:46:48,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:46:48,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5367 transitions. [2022-12-13 19:46:48,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 149.08333333333334) internal successors, (5367), 36 states have internal predecessors, (5367), 0 states have call successors, (0), 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:46:48,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 467.0) internal successors, (17279), 37 states have internal predecessors, (17279), 0 states have call successors, (0), 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:46:48,352 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 467.0) internal successors, (17279), 37 states have internal predecessors, (17279), 0 states have call successors, (0), 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:46:48,352 INFO L175 Difference]: Start difference. First operand has 103 places, 160 transitions, 1349 flow. Second operand 36 states and 5367 transitions. [2022-12-13 19:46:48,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 584 transitions, 5351 flow [2022-12-13 19:46:48,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 584 transitions, 5275 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-13 19:46:48,459 INFO L231 Difference]: Finished difference. Result has 156 places, 347 transitions, 4036 flow [2022-12-13 19:46:48,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4036, PETRI_PLACES=156, PETRI_TRANSITIONS=347} [2022-12-13 19:46:48,460 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2022-12-13 19:46:48,460 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 347 transitions, 4036 flow [2022-12-13 19:46:48,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 141.32258064516128) internal successors, (4381), 31 states have internal predecessors, (4381), 0 states have call successors, (0), 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:46:48,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:46:48,461 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, 1, 1] [2022-12-13 19:46:48,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:46:48,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:48,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:46:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:46:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1518193026, now seen corresponding path program 4 times [2022-12-13 19:46:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:46:48,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301967873] [2022-12-13 19:46:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:46:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:46:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:46:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:46:49,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301967873] [2022-12-13 19:46:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301967873] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:46:49,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674203233] [2022-12-13 19:46:49,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:46:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:46:49,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:46:49,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:46:49,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:46:49,891 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:46:49,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:46:49,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 19:46:49,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:46:50,429 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 19:46:50,429 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 115 treesize of output 85 [2022-12-13 19:46:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:46:50,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:46:51,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:46:51,688 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 143 treesize of output 75 [2022-12-13 19:46:51,730 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 19:46:51,731 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 125 treesize of output 57 [2022-12-13 19:46:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:46:51,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674203233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:46:51,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:46:51,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-13 19:46:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686178303] [2022-12-13 19:46:51,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:46:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 19:46:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:46:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 19:46:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2022-12-13 19:46:55,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 467 [2022-12-13 19:46:55,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 347 transitions, 4036 flow. Second operand has 31 states, 31 states have (on average 173.32258064516128) internal successors, (5373), 31 states have internal predecessors, (5373), 0 states have call successors, (0), 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:46:55,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:46:55,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 467 [2022-12-13 19:46:55,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:46:58,897 INFO L130 PetriNetUnfolder]: 5252/7688 cut-off events. [2022-12-13 19:46:58,897 INFO L131 PetriNetUnfolder]: For 70626/70626 co-relation queries the response was YES. [2022-12-13 19:46:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45887 conditions, 7688 events. 5252/7688 cut-off events. For 70626/70626 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 40924 event pairs, 1105 based on Foata normal form. 2/7690 useless extension candidates. Maximal degree in co-relation 45680. Up to 6146 conditions per place. [2022-12-13 19:46:58,944 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 339 selfloop transitions, 259 changer transitions 7/605 dead transitions. [2022-12-13 19:46:58,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 605 transitions, 7942 flow [2022-12-13 19:46:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 19:46:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 19:46:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3230 transitions. [2022-12-13 19:46:58,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3842493457054485 [2022-12-13 19:46:58,950 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3230 transitions. [2022-12-13 19:46:58,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3230 transitions. [2022-12-13 19:46:58,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:46:58,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3230 transitions. [2022-12-13 19:46:58,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 179.44444444444446) internal successors, (3230), 18 states have internal predecessors, (3230), 0 states have call successors, (0), 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:46:58,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 467.0) internal successors, (8873), 19 states have internal predecessors, (8873), 0 states have call successors, (0), 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:46:58,960 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 467.0) internal successors, (8873), 19 states have internal predecessors, (8873), 0 states have call successors, (0), 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:46:58,961 INFO L175 Difference]: Start difference. First operand has 156 places, 347 transitions, 4036 flow. Second operand 18 states and 3230 transitions. [2022-12-13 19:46:58,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 605 transitions, 7942 flow [2022-12-13 19:46:59,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 605 transitions, 7484 flow, removed 213 selfloop flow, removed 5 redundant places. [2022-12-13 19:46:59,392 INFO L231 Difference]: Finished difference. Result has 175 places, 515 transitions, 6542 flow [2022-12-13 19:46:59,393 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6542, PETRI_PLACES=175, PETRI_TRANSITIONS=515} [2022-12-13 19:46:59,393 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2022-12-13 19:46:59,393 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 515 transitions, 6542 flow [2022-12-13 19:46:59,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 173.32258064516128) internal successors, (5373), 31 states have internal predecessors, (5373), 0 states have call successors, (0), 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:46:59,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:46:59,394 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, 1, 1] [2022-12-13 19:46:59,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:46:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 19:46:59,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:46:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:46:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1369055790, now seen corresponding path program 5 times [2022-12-13 19:46:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:46:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432841044] [2022-12-13 19:46:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:46:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:46:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432841044] [2022-12-13 19:47:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432841044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:47:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63437821] [2022-12-13 19:47:00,481 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:47:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:47:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:47:00,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:47:00,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:47:00,554 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:47:00,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:47:00,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 19:47:00,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:00,620 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:47:00,669 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:47:00,740 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:47:00,789 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:47:01,133 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 19:47:01,134 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 125 treesize of output 85 [2022-12-13 19:47:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:01,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:47:03,077 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse0 (+ c_~mts1~0 (select .cse2 c_~A~0.offset)))) (or (< .cse0 0) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (let ((.cse1 (+ (select .cse2 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4))) c_~mts3~0))) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (= .cse1 .cse0) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)) (< .cse1 0)))) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse4 (+ c_~mts1~0 (select .cse3 c_~A~0.offset)))) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (not (< (+ (select .cse3 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4))) c_~mts3~0) 0)) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)))) (< .cse4 0) (not (<= .cse4 2147483647)) (= 0 .cse4))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse5 (+ c_~mts1~0 (select .cse6 c_~A~0.offset)))) (or (< .cse5 0) (not (<= .cse5 2147483647)) (< (+ (select .cse6 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4))) c_~mts3~0) 0))))) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse7 2147483648))) (not (< (+ c_~mts1~0 .cse7) 0)) (< (+ (select .cse8 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4))) c_~mts3~0) 0))))) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)))))) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse11 (select .cse10 c_~A~0.offset))) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (let ((.cse9 (+ (select .cse10 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4))) c_~mts3~0))) (or (= .cse9 0) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)) (< .cse9 0)))) (not (<= 0 (+ c_~mts1~0 .cse11 2147483648))) (not (< (+ c_~mts1~0 .cse11) 0)))))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4)))) (.cse12 (+ c_~mts1~0 (select .cse14 c_~A~0.offset)))) (or (< .cse12 0) (not (< (+ .cse13 c_~mts3~0) 0)) (< (+ c_~sum~0 .cse13 c_~mts2~0) 1) (not (<= .cse12 2147483647)))))) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|)))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_50| Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_50| c_~N~0)) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_342) c_~A~0.base))) (let ((.cse15 (select .cse17 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_50| 4)))) (.cse16 (select .cse17 c_~A~0.offset))) (or (not (< (+ .cse15 c_~mts3~0) 0)) (< (+ c_~sum~0 .cse15 c_~mts2~0) 1) (not (<= 0 (+ c_~mts1~0 .cse16 2147483648))) (not (< (+ c_~mts1~0 .cse16) 0)))))) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_50|))))) is different from false [2022-12-13 19:47:04,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:04,582 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 132 treesize of output 96 [2022-12-13 19:47:04,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:04,594 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 1239 treesize of output 1201 [2022-12-13 19:47:04,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:04,614 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 1191 treesize of output 1073 [2022-12-13 19:47:04,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:04,639 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 799 treesize of output 777 [2022-12-13 19:47:04,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:04,661 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 1031 treesize of output 977 [2022-12-13 19:47:07,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:07,767 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 96 treesize of output 72 [2022-12-13 19:47:07,786 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:07,787 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 877 treesize of output 849 [2022-12-13 19:47:07,817 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:07,817 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 845 treesize of output 769 [2022-12-13 19:47:07,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:07,845 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 513 treesize of output 493 [2022-12-13 19:47:07,870 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:07,870 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 745 treesize of output 709 [2022-12-13 19:47:08,495 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:47:08,495 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 98 treesize of output 1 [2022-12-13 19:47:08,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:08,505 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 132 treesize of output 96 [2022-12-13 19:47:08,528 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:08,529 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 1239 treesize of output 1195 [2022-12-13 19:47:08,560 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:08,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 1191 treesize of output 1163 [2022-12-13 19:47:08,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:08,599 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 875 treesize of output 811 [2022-12-13 19:47:08,633 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:08,633 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 1095 treesize of output 971 [2022-12-13 19:47:09,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:09,502 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 157 treesize of output 109 [2022-12-13 19:47:09,524 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:09,524 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 616 treesize of output 592 [2022-12-13 19:47:09,549 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:09,549 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 584 treesize of output 516 [2022-12-13 19:47:09,574 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:09,574 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 496 treesize of output 464 [2022-12-13 19:47:09,605 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:09,605 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 295 treesize of output 281 [2022-12-13 19:47:10,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:10,579 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 127 treesize of output 91 [2022-12-13 19:47:10,604 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:10,604 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 1159 treesize of output 1123 [2022-12-13 19:47:10,635 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:10,636 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 1119 treesize of output 1075 [2022-12-13 19:47:10,664 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:10,664 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 1071 treesize of output 979 [2022-12-13 19:47:10,693 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:10,693 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 747 treesize of output 727 [2022-12-13 19:47:11,612 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:47:11,613 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 134 treesize of output 1 [2022-12-13 19:47:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:11,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63437821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:47:11,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:47:11,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 19:47:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459405725] [2022-12-13 19:47:11,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:47:11,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 19:47:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 19:47:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=4, NotChecked=56, Total=930 [2022-12-13 19:47:12,334 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 467 [2022-12-13 19:47:12,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 515 transitions, 6542 flow. Second operand has 31 states, 31 states have (on average 138.2258064516129) internal successors, (4285), 31 states have internal predecessors, (4285), 0 states have call successors, (0), 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:47:12,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:47:12,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 467 [2022-12-13 19:47:12,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:47:18,310 INFO L130 PetriNetUnfolder]: 6150/9209 cut-off events. [2022-12-13 19:47:18,310 INFO L131 PetriNetUnfolder]: For 98365/98666 co-relation queries the response was YES. [2022-12-13 19:47:18,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57673 conditions, 9209 events. 6150/9209 cut-off events. For 98365/98666 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 54162 event pairs, 888 based on Foata normal form. 155/9292 useless extension candidates. Maximal degree in co-relation 57420. Up to 6248 conditions per place. [2022-12-13 19:47:18,409 INFO L137 encePairwiseOnDemand]: 456/467 looper letters, 458 selfloop transitions, 346 changer transitions 14/842 dead transitions. [2022-12-13 19:47:18,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 842 transitions, 11652 flow [2022-12-13 19:47:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 19:47:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 19:47:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3342 transitions. [2022-12-13 19:47:18,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3111442137603575 [2022-12-13 19:47:18,415 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3342 transitions. [2022-12-13 19:47:18,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3342 transitions. [2022-12-13 19:47:18,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:18,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3342 transitions. [2022-12-13 19:47:18,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 145.30434782608697) internal successors, (3342), 23 states have internal predecessors, (3342), 0 states have call successors, (0), 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:47:18,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 467.0) internal successors, (11208), 24 states have internal predecessors, (11208), 0 states have call successors, (0), 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:47:18,433 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 467.0) internal successors, (11208), 24 states have internal predecessors, (11208), 0 states have call successors, (0), 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:47:18,433 INFO L175 Difference]: Start difference. First operand has 175 places, 515 transitions, 6542 flow. Second operand 23 states and 3342 transitions. [2022-12-13 19:47:18,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 842 transitions, 11652 flow [2022-12-13 19:47:18,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 842 transitions, 11409 flow, removed 119 selfloop flow, removed 2 redundant places. [2022-12-13 19:47:18,920 INFO L231 Difference]: Finished difference. Result has 203 places, 703 transitions, 9956 flow [2022-12-13 19:47:18,920 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=6395, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9956, PETRI_PLACES=203, PETRI_TRANSITIONS=703} [2022-12-13 19:47:18,921 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2022-12-13 19:47:18,921 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 703 transitions, 9956 flow [2022-12-13 19:47:18,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 138.2258064516129) internal successors, (4285), 31 states have internal predecessors, (4285), 0 states have call successors, (0), 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:47:18,921 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:47:18,921 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, 1, 1] [2022-12-13 19:47:18,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:47:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:47:19,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:47:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 826843226, now seen corresponding path program 6 times [2022-12-13 19:47:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682776140] [2022-12-13 19:47:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:20,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682776140] [2022-12-13 19:47:20,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682776140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:47:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828139278] [2022-12-13 19:47:20,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:47:20,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:47:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:47:20,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:47:20,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:47:20,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 19:47:20,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:47:20,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 19:47:20,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:20,228 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:47:20,309 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:47:20,376 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:47:20,437 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:47:20,859 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 19:47:20,859 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 115 treesize of output 85 [2022-12-13 19:47:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:21,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:47:24,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~sum~0 c_~mts2~0))) (let ((.cse14 (<= .cse7 c_~mts3~0))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< (+ c_~mts1~0 .cse0) 0)) (not (< (+ .cse1 c_~mts3~0) 0)) (<= (+ .cse1 c_~sum~0 c_~mts2~0) 0) (not (<= 0 (+ c_~mts1~0 .cse0 2147483648))))))) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (+ c_~mts1~0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse3 (+ .cse5 c_~mts3~0))) (or (< .cse3 0) (not (<= .cse4 2147483647)) (< .cse4 0) (= .cse4 (+ .cse5 c_~sum~0 c_~mts2~0)) (= .cse4 .cse3)))))))) (or (< c_~mts3~0 .cse7) (forall ((v_ArrVal_391 (Array Int Int)) (~M~0 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (+ c_~mts1~0 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse8 (+ (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts3~0))) (or (< .cse8 0) (not (<= .cse9 2147483647)) (< .cse9 0) (< 0 ~M~0) (< ~M~0 0) (= .cse9 .cse8)))))) (or (forall ((v_ArrVal_391 (Array Int Int)) (~M~0 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (+ c_~mts1~0 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse11 (+ (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts3~0))) (or (< .cse11 0) (not (<= .cse12 2147483647)) (< 0 ~M~0) (< ~M~0 0) (not (= .cse12 .cse11)))))) .cse14) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (~M~0 Int) (v_ArrVal_389 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ (select .cse15 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts3~0) 0) (not (< (+ c_~mts1~0 .cse16) 0)) (< 0 ~M~0) (< ~M~0 0) (not (<= 0 (+ c_~mts1~0 .cse16 2147483648))))))) .cse14) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (+ (select .cse19 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts3~0)) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse17 0) (not (< (+ c_~mts1~0 .cse18) 0)) (= .cse17 0) (not (<= 0 (+ c_~mts1~0 .cse18 2147483648))))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse21 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= 0 (+ .cse20 c_~mts3~0)) (<= (+ .cse20 c_~sum~0 c_~mts2~0) 0) (not (= (+ c_~mts1~0 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)))))) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (+ c_~mts1~0 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse23 (select .cse24 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse22 0) (not (<= .cse22 2147483647)) (< .cse22 0) (not (< (+ .cse23 c_~mts3~0) 0)) (= .cse22 (+ .cse23 c_~sum~0 c_~mts2~0)))))) (< 0 ~M~0) (< ~M~0 0)))))) is different from false [2022-12-13 19:47:24,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:24,219 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 132 treesize of output 96 [2022-12-13 19:47:24,238 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:24,239 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 2519 treesize of output 2427 [2022-12-13 19:47:24,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:24,274 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 1787 treesize of output 1723 [2022-12-13 19:47:24,301 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:24,302 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 2359 treesize of output 2107 [2022-12-13 19:47:24,348 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:24,348 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 2103 treesize of output 1979 [2022-12-13 19:47:26,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:26,558 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 157 treesize of output 109 [2022-12-13 19:47:26,575 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:26,576 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 616 treesize of output 592 [2022-12-13 19:47:26,596 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:26,597 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 584 treesize of output 516 [2022-12-13 19:47:26,618 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:26,619 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 496 treesize of output 464 [2022-12-13 19:47:26,655 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:26,655 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 295 treesize of output 281 [2022-12-13 19:47:27,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:27,353 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 134 treesize of output 98 [2022-12-13 19:47:27,380 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:27,380 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 5208 treesize of output 5020 [2022-12-13 19:47:27,439 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:27,440 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 5016 treesize of output 4892 [2022-12-13 19:47:27,498 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:27,499 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 4888 treesize of output 4380 [2022-12-13 19:47:27,565 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:27,566 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 4376 treesize of output 4124 [2022-12-13 19:47:29,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:29,171 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 128 treesize of output 92 [2022-12-13 19:47:29,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,192 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 1026 treesize of output 982 [2022-12-13 19:47:29,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:29,214 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 814 treesize of output 734 [2022-12-13 19:47:29,232 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,232 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 890 treesize of output 862 [2022-12-13 19:47:29,255 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,255 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 850 treesize of output 726 [2022-12-13 19:47:29,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:29,642 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 101 treesize of output 77 [2022-12-13 19:47:29,663 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,663 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 1945 treesize of output 1869 [2022-12-13 19:47:29,698 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,698 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 1865 treesize of output 1645 [2022-12-13 19:47:29,733 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,733 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 1641 treesize of output 1533 [2022-12-13 19:47:29,769 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:29,769 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 1529 treesize of output 1477 [2022-12-13 19:47:30,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:30,246 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 98 treesize of output 74 [2022-12-13 19:47:30,264 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,264 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 440 treesize of output 428 [2022-12-13 19:47:30,285 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,286 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 424 treesize of output 388 [2022-12-13 19:47:30,303 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,304 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 384 treesize of output 368 [2022-12-13 19:47:30,323 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,323 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 309 treesize of output 303 [2022-12-13 19:47:30,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:30,812 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 189 treesize of output 129 [2022-12-13 19:47:30,839 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,839 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 3196 treesize of output 3072 [2022-12-13 19:47:30,894 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,895 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 3056 treesize of output 2740 [2022-12-13 19:47:30,949 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:30,950 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 2688 treesize of output 2532 [2022-12-13 19:47:31,003 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:31,004 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 2504 treesize of output 2428 [2022-12-13 19:47:34,497 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:47:34,498 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 219 treesize of output 1 [2022-12-13 19:47:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 19:47:34,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828139278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:47:34,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:47:34,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 34 [2022-12-13 19:47:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784865740] [2022-12-13 19:47:34,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:47:34,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 19:47:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 19:47:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=998, Unknown=6, NotChecked=66, Total=1260 [2022-12-13 19:47:34,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 467 [2022-12-13 19:47:34,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 703 transitions, 9956 flow. Second operand has 36 states, 36 states have (on average 135.0) internal successors, (4860), 36 states have internal predecessors, (4860), 0 states have call successors, (0), 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:47:34,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:47:34,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 467 [2022-12-13 19:47:34,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:47:39,877 INFO L130 PetriNetUnfolder]: 7034/10462 cut-off events. [2022-12-13 19:47:39,877 INFO L131 PetriNetUnfolder]: For 122983/122983 co-relation queries the response was YES. [2022-12-13 19:47:39,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71877 conditions, 10462 events. 7034/10462 cut-off events. For 122983/122983 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 60589 event pairs, 1163 based on Foata normal form. 2/10464 useless extension candidates. Maximal degree in co-relation 71571. Up to 8129 conditions per place. [2022-12-13 19:47:39,960 INFO L137 encePairwiseOnDemand]: 453/467 looper letters, 420 selfloop transitions, 537 changer transitions 1/958 dead transitions. [2022-12-13 19:47:39,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 958 transitions, 15366 flow [2022-12-13 19:47:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 19:47:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 19:47:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2394 transitions. [2022-12-13 19:47:39,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30154931351555614 [2022-12-13 19:47:39,964 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2394 transitions. [2022-12-13 19:47:39,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2394 transitions. [2022-12-13 19:47:39,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:39,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2394 transitions. [2022-12-13 19:47:39,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 140.8235294117647) internal successors, (2394), 17 states have internal predecessors, (2394), 0 states have call successors, (0), 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:47:39,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 467.0) internal successors, (8406), 18 states have internal predecessors, (8406), 0 states have call successors, (0), 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:47:39,972 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 467.0) internal successors, (8406), 18 states have internal predecessors, (8406), 0 states have call successors, (0), 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:47:39,972 INFO L175 Difference]: Start difference. First operand has 203 places, 703 transitions, 9956 flow. Second operand 17 states and 2394 transitions. [2022-12-13 19:47:39,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 958 transitions, 15366 flow [2022-12-13 19:47:40,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 958 transitions, 14705 flow, removed 266 selfloop flow, removed 4 redundant places. [2022-12-13 19:47:40,716 INFO L231 Difference]: Finished difference. Result has 223 places, 866 transitions, 13781 flow [2022-12-13 19:47:40,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=9507, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13781, PETRI_PLACES=223, PETRI_TRANSITIONS=866} [2022-12-13 19:47:40,717 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 191 predicate places. [2022-12-13 19:47:40,717 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 866 transitions, 13781 flow [2022-12-13 19:47:40,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 135.0) internal successors, (4860), 36 states have internal predecessors, (4860), 0 states have call successors, (0), 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:47:40,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:47:40,718 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, 1, 1] [2022-12-13 19:47:40,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 19:47:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:47:40,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:47:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 996104686, now seen corresponding path program 7 times [2022-12-13 19:47:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:40,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486610880] [2022-12-13 19:47:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:41,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486610880] [2022-12-13 19:47:41,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486610880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:47:41,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321251903] [2022-12-13 19:47:41,688 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:47:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:47:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:47:41,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:47:41,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:47:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:41,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 19:47:41,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:41,817 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:47:41,881 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:47:41,935 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:47:41,989 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:47:42,374 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 19:47:42,374 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 125 treesize of output 85 [2022-12-13 19:47:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:42,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:47:43,844 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_440 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse3 (select .cse1 c_~A~0.offset))) (let ((.cse0 (+ .cse3 c_~mts1~0))) (or (not (<= .cse0 2147483647)) (< .cse0 0) (< (+ c_~sum~0 (select .cse1 .cse2) c_~mts2~0) (+ .cse3 c_~mts1~0 1))))))) (forall ((v_ArrVal_440 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse4 (select .cse5 c_~A~0.offset))) (or (not (< (+ .cse4 c_~mts1~0) 0)) (< (+ c_~sum~0 (select .cse5 .cse2) c_~mts2~0) 1) (not (<= 0 (+ .cse4 c_~mts1~0 2147483648))))))) (forall ((v_ArrVal_440 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse6 (+ (select .cse7 c_~A~0.offset) c_~mts1~0))) (or (not (<= .cse6 2147483647)) (< .cse6 0) (not (< (+ c_~mts3~0 (select .cse7 .cse2)) 0)) (= .cse6 0))))) (forall ((v_ArrVal_440 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse8 (+ c_~mts3~0 (select .cse10 .cse2))) (.cse9 (select .cse10 c_~A~0.offset))) (or (< .cse8 0) (= .cse8 0) (not (< (+ .cse9 c_~mts1~0) 0)) (not (<= 0 (+ .cse9 c_~mts1~0 2147483648))))))) (forall ((v_ArrVal_440 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse11 (+ c_~mts3~0 (select .cse13 .cse2))) (.cse12 (+ (select .cse13 c_~A~0.offset) c_~mts1~0))) (or (< .cse11 0) (not (<= .cse12 2147483647)) (= .cse12 .cse11) (< .cse12 0))))))) is different from false [2022-12-13 19:47:43,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse0 (+ c_~mts1~0 (select .cse1 c_~A~0.offset)))) (or (= .cse0 0) (< .cse0 0) (not (< (+ c_~mts3~0 (select .cse1 .cse2)) 0)) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse5 .cse2))) (.cse3 (+ c_~mts1~0 (select .cse5 c_~A~0.offset)))) (or (< .cse3 0) (< .cse4 0) (= .cse4 .cse3) (not (<= .cse3 2147483647)))))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse8 (select .cse7 c_~A~0.offset))) (let ((.cse6 (+ c_~mts1~0 .cse8))) (or (< .cse6 0) (< (+ c_~sum~0 c_~mts2~0 (select .cse7 .cse2)) (+ c_~mts1~0 .cse8 1)) (not (<= .cse6 2147483647))))))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse10 (+ c_~mts3~0 (select .cse11 .cse2))) (.cse9 (select .cse11 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse9 2147483648))) (= .cse10 0) (< .cse10 0) (not (< (+ c_~mts1~0 .cse9) 0)))))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse12 2147483648))) (not (< (+ c_~mts1~0 .cse12) 0)) (< (+ c_~sum~0 c_~mts2~0 (select .cse13 .cse2)) 1))))))) is different from false [2022-12-13 19:47:44,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:44,451 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 132 treesize of output 96 [2022-12-13 19:47:44,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:44,468 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 1239 treesize of output 1201 [2022-12-13 19:47:44,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:44,491 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 1191 treesize of output 1073 [2022-12-13 19:47:44,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:44,518 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 799 treesize of output 777 [2022-12-13 19:47:44,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:44,544 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 1031 treesize of output 977 [2022-12-13 19:47:48,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:48,753 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 127 treesize of output 91 [2022-12-13 19:47:48,777 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:48,778 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 2359 treesize of output 2283 [2022-12-13 19:47:48,831 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:48,832 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 2279 treesize of output 2187 [2022-12-13 19:47:48,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:48,868 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 1683 treesize of output 1635 [2022-12-13 19:47:48,897 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:48,898 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 2135 treesize of output 1947 [2022-12-13 19:47:53,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:53,839 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 99 treesize of output 75 [2022-12-13 19:47:53,854 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:53,854 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 926 treesize of output 898 [2022-12-13 19:47:53,883 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:53,883 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 894 treesize of output 858 [2022-12-13 19:47:53,907 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:53,908 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 854 treesize of output 778 [2022-12-13 19:47:53,932 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:53,933 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 651 treesize of output 635 [2022-12-13 19:47:54,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:54,279 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 157 treesize of output 109 [2022-12-13 19:47:54,298 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:54,298 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 1274 treesize of output 1222 [2022-12-13 19:47:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:54,324 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 761 treesize of output 717 [2022-12-13 19:47:54,346 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:54,346 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 1166 treesize of output 1026 [2022-12-13 19:47:54,374 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:54,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 990 treesize of output 922 [2022-12-13 19:47:56,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:56,766 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 125 treesize of output 89 [2022-12-13 19:47:56,787 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:56,788 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 1985 treesize of output 1909 [2022-12-13 19:47:56,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:56,817 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 1229 treesize of output 1173 [2022-12-13 19:47:56,840 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:56,841 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 1841 treesize of output 1653 [2022-12-13 19:47:56,870 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:56,871 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 1617 treesize of output 1525 [2022-12-13 19:47:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:57,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321251903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:47:57,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:47:57,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 19:47:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773544992] [2022-12-13 19:47:57,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:47:57,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 19:47:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 19:47:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=694, Unknown=2, NotChecked=110, Total=930 [2022-12-13 19:47:57,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 467 [2022-12-13 19:47:57,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 866 transitions, 13781 flow. Second operand has 31 states, 31 states have (on average 138.2258064516129) internal successors, (4285), 31 states have internal predecessors, (4285), 0 states have call successors, (0), 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:47:57,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:47:57,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 467 [2022-12-13 19:47:57,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:48:02,668 INFO L130 PetriNetUnfolder]: 7369/11116 cut-off events. [2022-12-13 19:48:02,668 INFO L131 PetriNetUnfolder]: For 152574/152889 co-relation queries the response was YES. [2022-12-13 19:48:02,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81436 conditions, 11116 events. 7369/11116 cut-off events. For 152574/152889 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 67813 event pairs, 1557 based on Foata normal form. 136/11139 useless extension candidates. Maximal degree in co-relation 81117. Up to 9054 conditions per place. [2022-12-13 19:48:02,760 INFO L137 encePairwiseOnDemand]: 456/467 looper letters, 651 selfloop transitions, 391 changer transitions 4/1070 dead transitions. [2022-12-13 19:48:02,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 1070 transitions, 18688 flow [2022-12-13 19:48:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:48:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 19:48:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2317 transitions. [2022-12-13 19:48:02,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31009100642398285 [2022-12-13 19:48:02,764 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2317 transitions. [2022-12-13 19:48:02,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2317 transitions. [2022-12-13 19:48:02,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:48:02,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2317 transitions. [2022-12-13 19:48:02,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 144.8125) internal successors, (2317), 16 states have internal predecessors, (2317), 0 states have call successors, (0), 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:48:02,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 467.0) internal successors, (7939), 17 states have internal predecessors, (7939), 0 states have call successors, (0), 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:48:02,770 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 467.0) internal successors, (7939), 17 states have internal predecessors, (7939), 0 states have call successors, (0), 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:48:02,770 INFO L175 Difference]: Start difference. First operand has 223 places, 866 transitions, 13781 flow. Second operand 16 states and 2317 transitions. [2022-12-13 19:48:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 1070 transitions, 18688 flow [2022-12-13 19:48:03,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1070 transitions, 18453 flow, removed 115 selfloop flow, removed 2 redundant places. [2022-12-13 19:48:03,615 INFO L231 Difference]: Finished difference. Result has 243 places, 984 transitions, 16812 flow [2022-12-13 19:48:03,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=13650, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=16812, PETRI_PLACES=243, PETRI_TRANSITIONS=984} [2022-12-13 19:48:03,616 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2022-12-13 19:48:03,616 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 984 transitions, 16812 flow [2022-12-13 19:48:03,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 138.2258064516129) internal successors, (4285), 31 states have internal predecessors, (4285), 0 states have call successors, (0), 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:48:03,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:48:03,617 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, 1, 1] [2022-12-13 19:48:03,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 19:48:03,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 19:48:03,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:48:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2018108272, now seen corresponding path program 8 times [2022-12-13 19:48:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:48:03,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96205969] [2022-12-13 19:48:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:48:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:48:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:48:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:48:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:48:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96205969] [2022-12-13 19:48:05,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96205969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:48:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543625939] [2022-12-13 19:48:05,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:48:05,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:48:05,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:48:05,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:48:05,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 19:48:05,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:48:05,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:05,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-13 19:48:05,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:05,540 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:48:05,610 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:48:05,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:48:05,776 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 20 treesize of output 22 [2022-12-13 19:48:05,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:48:05,930 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 20 treesize of output 22 [2022-12-13 19:48:06,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:06,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:06,164 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 94 treesize of output 53 [2022-12-13 19:48:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:48:06,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:06,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (let ((.cse3 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base) .cse1))) (or (< (+ c_~sum~0 c_~mts2~0 .cse0) 1) (not (< (+ c_~mts3~0 .cse0) 0))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_489 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base) .cse1)) 0))) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base))) (or (not (< (+ c_~mts3~0 (select .cse2 .cse1)) 0)) (= (+ (select .cse2 .cse3) c_~mts1~0) 0)))) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base))) (let ((.cse5 (+ c_~mts3~0 (select .cse4 .cse1)))) (or (= (+ (select .cse4 .cse3) c_~mts1~0) .cse5) (< .cse5 0))))))) .cse6 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647))) (or (not .cse6) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648))) (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse7 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base) .cse1)))) (or (= .cse7 0) (< .cse7 0)))) (forall ((v_ArrVal_489 (Array Int Int))) (< (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_489) c_~A~0.base) .cse1)) 1)))))) is different from false [2022-12-13 19:48:18,297 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:48:18,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2022-12-13 19:48:18,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,375 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 383 treesize of output 369 [2022-12-13 19:48:18,383 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 314 treesize of output 266 [2022-12-13 19:48:18,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,404 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 169 treesize of output 163 [2022-12-13 19:48:18,414 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 254 treesize of output 230 [2022-12-13 19:48:18,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,810 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 120 treesize of output 84 [2022-12-13 19:48:18,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,827 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 717 treesize of output 687 [2022-12-13 19:48:18,841 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 315 treesize of output 267 [2022-12-13 19:48:18,852 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 579 treesize of output 483 [2022-12-13 19:48:18,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:18,870 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 533 treesize of output 515 [2022-12-13 19:48:20,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:20,940 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 87 treesize of output 63 [2022-12-13 19:48:20,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:20,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:20,959 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:20,960 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 94 treesize of output 82 [2022-12-13 19:48:20,975 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:20,975 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 67 treesize of output 61 [2022-12-13 19:48:21,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:21,028 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 145 treesize of output 97 [2022-12-13 19:48:21,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,043 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,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 130 treesize of output 106 [2022-12-13 19:48:21,058 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,059 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 70 treesize of output 56 [2022-12-13 19:48:21,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:21,119 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 120 treesize of output 84 [2022-12-13 19:48:21,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,140 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,140 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 125 treesize of output 105 [2022-12-13 19:48:21,155 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,156 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 80 treesize of output 68 [2022-12-13 19:48:21,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:21,236 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 115 treesize of output 79 [2022-12-13 19:48:21,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:21,256 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,257 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 115 treesize of output 99 [2022-12-13 19:48:21,274 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:21,274 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 75 treesize of output 67 [2022-12-13 19:48:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:48:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543625939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:21,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:48:21,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2022-12-13 19:48:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996335363] [2022-12-13 19:48:21,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:21,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 19:48:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:48:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 19:48:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=899, Unknown=7, NotChecked=62, Total=1122 [2022-12-13 19:48:21,529 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 467 [2022-12-13 19:48:21,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 984 transitions, 16812 flow. Second operand has 34 states, 34 states have (on average 135.11764705882354) internal successors, (4594), 34 states have internal predecessors, (4594), 0 states have call successors, (0), 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:48:21,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:48:21,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 467 [2022-12-13 19:48:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:48:27,934 INFO L130 PetriNetUnfolder]: 8503/12664 cut-off events. [2022-12-13 19:48:27,934 INFO L131 PetriNetUnfolder]: For 198109/198109 co-relation queries the response was YES. [2022-12-13 19:48:27,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96934 conditions, 12664 events. 8503/12664 cut-off events. For 198109/198109 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 76232 event pairs, 1812 based on Foata normal form. 2/12666 useless extension candidates. Maximal degree in co-relation 96599. Up to 10956 conditions per place. [2022-12-13 19:48:28,038 INFO L137 encePairwiseOnDemand]: 454/467 looper letters, 840 selfloop transitions, 363 changer transitions 7/1210 dead transitions. [2022-12-13 19:48:28,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1210 transitions, 22192 flow [2022-12-13 19:48:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:48:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 19:48:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3114 transitions. [2022-12-13 19:48:28,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30309519174615535 [2022-12-13 19:48:28,042 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3114 transitions. [2022-12-13 19:48:28,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3114 transitions. [2022-12-13 19:48:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:48:28,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3114 transitions. [2022-12-13 19:48:28,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 141.54545454545453) internal successors, (3114), 22 states have internal predecessors, (3114), 0 states have call successors, (0), 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:48:28,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 467.0) internal successors, (10741), 23 states have internal predecessors, (10741), 0 states have call successors, (0), 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:48:28,050 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 467.0) internal successors, (10741), 23 states have internal predecessors, (10741), 0 states have call successors, (0), 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:48:28,050 INFO L175 Difference]: Start difference. First operand has 243 places, 984 transitions, 16812 flow. Second operand 22 states and 3114 transitions. [2022-12-13 19:48:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1210 transitions, 22192 flow [2022-12-13 19:48:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 1210 transitions, 21628 flow, removed 172 selfloop flow, removed 8 redundant places. [2022-12-13 19:48:29,338 INFO L231 Difference]: Finished difference. Result has 266 places, 1082 transitions, 19359 flow [2022-12-13 19:48:29,339 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=16273, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19359, PETRI_PLACES=266, PETRI_TRANSITIONS=1082} [2022-12-13 19:48:29,339 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 234 predicate places. [2022-12-13 19:48:29,339 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 1082 transitions, 19359 flow [2022-12-13 19:48:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 135.11764705882354) internal successors, (4594), 34 states have internal predecessors, (4594), 0 states have call successors, (0), 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:48:29,340 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:48:29,340 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, 1, 1] [2022-12-13 19:48:29,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 19:48:29,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:48:29,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:48:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -911528042, now seen corresponding path program 9 times [2022-12-13 19:48:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:48:29,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990149802] [2022-12-13 19:48:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:48:29,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:48:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:48:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:48:30,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:48:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990149802] [2022-12-13 19:48:30,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990149802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:48:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278237457] [2022-12-13 19:48:30,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:48:30,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:48:30,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:48:30,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:48:30,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 19:48:30,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 19:48:30,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:30,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 19:48:30,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:30,693 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:48:30,750 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:48:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:48:30,922 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 20 treesize of output 22 [2022-12-13 19:48:31,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:48:31,144 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 51 treesize of output 45 [2022-12-13 19:48:31,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:31,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:31,390 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 94 treesize of output 53 [2022-12-13 19:48:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:48:31,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:32,101 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (let ((.cse1 (+ c_~mts3~0 .cse0))) (or (= c_~mts1~0 (+ c_~sum~0 c_~mts2~0 .cse0)) (< .cse1 0) (= .cse1 c_~mts1~0))))) (or (and (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (or (not (< (+ c_~mts3~0 .cse3) 0)) (< 0 (+ c_~sum~0 c_~mts2~0 .cse3))))) (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (or (not (< (+ c_~mts3~0 .cse4) 0)) (= c_~mts1~0 (+ c_~sum~0 c_~mts2~0 .cse4)))))) (= c_~mts1~0 0)) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)) c_~mts1~0)) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse5 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)))) (or (< .cse5 0) (= .cse5 c_~mts1~0)))) (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))))) is different from false [2022-12-13 19:48:32,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0)) (.cse3 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (not .cse0) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648))) (and (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)))) (or (= .cse1 0) (< .cse1 0)))) .cse3) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)) 0)) (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (let ((.cse4 (+ c_~mts3~0 .cse5))) (or (= .cse4 0) (< .cse4 0) (= (+ c_~sum~0 c_~mts2~0 .cse5) 0))))))) (or .cse0 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647)) (let ((.cse6 (+ (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) c_~mts1~0))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)) .cse6)) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2)))) (or (= .cse6 .cse7) (< .cse7 0)))) .cse3) (or (and (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (or (= .cse6 (+ c_~sum~0 c_~mts2~0 .cse8)) (not (< (+ c_~mts3~0 .cse8) 0))))) (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (or (not (< (+ c_~mts3~0 .cse9) 0)) (< 0 (+ c_~sum~0 c_~mts2~0 .cse9)))))) (= .cse6 0)) (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~A~0.base) .cse2))) (let ((.cse10 (+ c_~mts3~0 .cse11))) (or (= .cse6 .cse10) (= .cse6 (+ c_~sum~0 c_~mts2~0 .cse11)) (< .cse10 0)))))))))) is different from false [2022-12-13 19:48:51,376 WARN L233 SmtUtils]: Spent 17.37s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:48:51,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:51,469 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 147 treesize of output 99 [2022-12-13 19:48:51,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:51,483 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 1516 treesize of output 1450 [2022-12-13 19:48:51,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:51,510 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 1395 treesize of output 1305 [2022-12-13 19:48:51,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:51,535 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 1305 treesize of output 1261 [2022-12-13 19:48:51,551 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 1196 treesize of output 1004 [2022-12-13 19:48:53,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:53,016 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 142 treesize of output 94 [2022-12-13 19:48:53,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,034 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,035 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 184 treesize of output 148 [2022-12-13 19:48:53,051 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,052 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 120 treesize of output 98 [2022-12-13 19:48:53,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:53,144 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 171 treesize of output 111 [2022-12-13 19:48:53,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,164 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,164 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 216 treesize of output 176 [2022-12-13 19:48:53,183 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,183 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 149 treesize of output 125 [2022-12-13 19:48:53,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:48:53,319 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 109 treesize of output 73 [2022-12-13 19:48:53,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:48:53,340 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,340 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 155 treesize of output 127 [2022-12-13 19:48:53,357 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:48:53,357 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 110 treesize of output 94 [2022-12-13 19:48:53,412 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:48:53,413 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 87 treesize of output 1 [2022-12-13 19:48:53,429 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:48:53,430 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 120 treesize of output 1 [2022-12-13 19:48:53,443 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:48:53,443 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 155 treesize of output 1 [2022-12-13 19:48:53,458 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 19:48:53,458 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 201 treesize of output 1 [2022-12-13 19:48:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 19:48:53,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278237457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:53,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:48:53,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-13 19:48:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866065815] [2022-12-13 19:48:53,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:53,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 19:48:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:48:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 19:48:53,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=796, Unknown=6, NotChecked=118, Total=1056 [2022-12-13 19:48:54,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 467 [2022-12-13 19:48:54,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1082 transitions, 19359 flow. Second operand has 33 states, 33 states have (on average 138.0909090909091) internal successors, (4557), 33 states have internal predecessors, (4557), 0 states have call successors, (0), 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:48:54,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:48:54,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 467 [2022-12-13 19:48:54,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:49:03,531 INFO L130 PetriNetUnfolder]: 8805/13220 cut-off events. [2022-12-13 19:49:03,531 INFO L131 PetriNetUnfolder]: For 226221/226589 co-relation queries the response was YES. [2022-12-13 19:49:03,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103367 conditions, 13220 events. 8805/13220 cut-off events. For 226221/226589 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 82744 event pairs, 1162 based on Foata normal form. 221/13349 useless extension candidates. Maximal degree in co-relation 103016. Up to 8465 conditions per place. [2022-12-13 19:49:03,659 INFO L137 encePairwiseOnDemand]: 448/467 looper letters, 614 selfloop transitions, 629 changer transitions 4/1276 dead transitions. [2022-12-13 19:49:03,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1276 transitions, 24338 flow [2022-12-13 19:49:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:49:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 19:49:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1911 transitions. [2022-12-13 19:49:03,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3147751605995717 [2022-12-13 19:49:03,663 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1911 transitions. [2022-12-13 19:49:03,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1911 transitions. [2022-12-13 19:49:03,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:49:03,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1911 transitions. [2022-12-13 19:49:03,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 147.0) internal successors, (1911), 13 states have internal predecessors, (1911), 0 states have call successors, (0), 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:49:03,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:49:03,668 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 467.0) internal successors, (6538), 14 states have internal predecessors, (6538), 0 states have call successors, (0), 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:49:03,668 INFO L175 Difference]: Start difference. First operand has 266 places, 1082 transitions, 19359 flow. Second operand 13 states and 1911 transitions. [2022-12-13 19:49:03,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1276 transitions, 24338 flow [2022-12-13 19:49:05,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 1276 transitions, 23965 flow, removed 133 selfloop flow, removed 7 redundant places. [2022-12-13 19:49:05,106 INFO L231 Difference]: Finished difference. Result has 276 places, 1181 transitions, 22701 flow [2022-12-13 19:49:05,107 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=19020, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=544, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=22701, PETRI_PLACES=276, PETRI_TRANSITIONS=1181} [2022-12-13 19:49:05,107 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 244 predicate places. [2022-12-13 19:49:05,107 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 1181 transitions, 22701 flow [2022-12-13 19:49:05,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 138.0909090909091) internal successors, (4557), 33 states have internal predecessors, (4557), 0 states have call successors, (0), 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:49:05,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:49:05,108 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, 1, 1] [2022-12-13 19:49:05,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 19:49:05,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 19:49:05,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:49:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1013817484, now seen corresponding path program 10 times [2022-12-13 19:49:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:05,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797135289] [2022-12-13 19:49:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:07,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797135289] [2022-12-13 19:49:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797135289] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:07,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303166658] [2022-12-13 19:49:07,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:49:07,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:07,236 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:07,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 19:49:07,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:49:07,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:49:07,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-13 19:49:07,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:07,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:49:07,816 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 51 treesize of output 45 [2022-12-13 19:49:08,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:49:08,111 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 51 treesize of output 45 [2022-12-13 19:49:08,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:49:08,535 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 88 treesize of output 54 [2022-12-13 19:49:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:09,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:10,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:49:10,845 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 423 treesize of output 379 [2022-12-13 19:49:10,853 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 353 treesize of output 329 [2022-12-13 19:49:10,861 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 329 treesize of output 317 [2022-12-13 19:49:10,868 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 317 treesize of output 305 [2022-12-13 19:49:10,875 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 305 treesize of output 299 [2022-12-13 19:49:10,882 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 299 treesize of output 275 [2022-12-13 19:49:10,889 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 275 treesize of output 263 [2022-12-13 19:49:11,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:49:11,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:49:11,215 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 19:49:11,215 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 209 treesize of output 93 [2022-12-13 19:49:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:11,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303166658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:49:11,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:49:11,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-12-13 19:49:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157071916] [2022-12-13 19:49:11,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 19:49:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 19:49:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1093, Unknown=3, NotChecked=0, Total=1260 [2022-12-13 19:49:17,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 467 [2022-12-13 19:49:17,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1181 transitions, 22701 flow. Second operand has 36 states, 36 states have (on average 138.0) internal successors, (4968), 36 states have internal predecessors, (4968), 0 states have call successors, (0), 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:49:17,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:49:17,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 467 [2022-12-13 19:49:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:49:30,633 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 128 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:49:39,441 WARN L233 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 149 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:49:49,207 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 174 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:49:53,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:50:21,639 WARN L233 SmtUtils]: Spent 15.44s on a formula simplification. DAG size of input: 191 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:29,669 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 128 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:36,704 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 107 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:42,042 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 152 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:49,732 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 82 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:51:10,562 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 174 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:51:23,846 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 173 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:51:39,248 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 212 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:51:46,543 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 193 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:51:46,551 INFO L130 PetriNetUnfolder]: 16210/23893 cut-off events. [2022-12-13 19:51:46,551 INFO L131 PetriNetUnfolder]: For 477826/477826 co-relation queries the response was YES. [2022-12-13 19:51:46,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203378 conditions, 23893 events. 16210/23893 cut-off events. For 477826/477826 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 156115 event pairs, 777 based on Foata normal form. 2/23895 useless extension candidates. Maximal degree in co-relation 203002. Up to 11024 conditions per place. [2022-12-13 19:51:46,845 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 803 selfloop transitions, 1810 changer transitions 1/2614 dead transitions. [2022-12-13 19:51:46,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 2614 transitions, 50452 flow [2022-12-13 19:51:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-13 19:51:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-13 19:51:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 10294 transitions. [2022-12-13 19:51:46,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31046234580933135 [2022-12-13 19:51:46,855 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 10294 transitions. [2022-12-13 19:51:46,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 10294 transitions. [2022-12-13 19:51:46,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:51:46,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 10294 transitions. [2022-12-13 19:51:46,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 144.98591549295776) internal successors, (10294), 71 states have internal predecessors, (10294), 0 states have call successors, (0), 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:51:46,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 467.0) internal successors, (33624), 72 states have internal predecessors, (33624), 0 states have call successors, (0), 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:51:46,950 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 467.0) internal successors, (33624), 72 states have internal predecessors, (33624), 0 states have call successors, (0), 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:51:46,950 INFO L175 Difference]: Start difference. First operand has 276 places, 1181 transitions, 22701 flow. Second operand 71 states and 10294 transitions. [2022-12-13 19:51:46,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 2614 transitions, 50452 flow [2022-12-13 19:51:51,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 2614 transitions, 49581 flow, removed 277 selfloop flow, removed 7 redundant places. [2022-12-13 19:51:51,402 INFO L231 Difference]: Finished difference. Result has 372 places, 2171 transitions, 46259 flow [2022-12-13 19:51:51,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=22292, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=891, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=46259, PETRI_PLACES=372, PETRI_TRANSITIONS=2171} [2022-12-13 19:51:51,403 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 340 predicate places. [2022-12-13 19:51:51,403 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 2171 transitions, 46259 flow [2022-12-13 19:51:51,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 138.0) internal successors, (4968), 36 states have internal predecessors, (4968), 0 states have call successors, (0), 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:51:51,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:51:51,404 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, 1, 1] [2022-12-13 19:51:51,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 19:51:51,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:51:51,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:51:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:51:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1847615938, now seen corresponding path program 11 times [2022-12-13 19:51:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:51:51,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7642099] [2022-12-13 19:51:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:51:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:51:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:51:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:51:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:51:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7642099] [2022-12-13 19:51:52,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7642099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:51:52,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952106236] [2022-12-13 19:51:52,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:51:52,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:51:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:51:52,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:51:52,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 19:51:52,594 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 19:51:52,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:51:52,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 19:51:52,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:51:53,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:51:53,251 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 115 treesize of output 97 [2022-12-13 19:51:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:51:53,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:51:54,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:51:54,653 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 214 treesize of output 128 [2022-12-13 19:51:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:51:55,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952106236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:51:55,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:51:55,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 26 [2022-12-13 19:51:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746593537] [2022-12-13 19:51:55,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:51:55,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 19:51:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:51:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 19:51:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2022-12-13 19:52:00,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 467 [2022-12-13 19:52:00,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 2171 transitions, 46259 flow. Second operand has 28 states, 28 states have (on average 172.57142857142858) internal successors, (4832), 28 states have internal predecessors, (4832), 0 states have call successors, (0), 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:52:00,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:52:00,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 467 [2022-12-13 19:52:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:52:31,952 INFO L130 PetriNetUnfolder]: 21111/30989 cut-off events. [2022-12-13 19:52:31,952 INFO L131 PetriNetUnfolder]: For 791963/791963 co-relation queries the response was YES. [2022-12-13 19:52:32,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299558 conditions, 30989 events. 21111/30989 cut-off events. For 791963/791963 co-relation queries the response was YES. Maximal size of possible extension queue 1879. Compared 209609 event pairs, 1993 based on Foata normal form. 4/30993 useless extension candidates. Maximal degree in co-relation 299099. Up to 17765 conditions per place. [2022-12-13 19:52:32,452 INFO L137 encePairwiseOnDemand]: 450/467 looper letters, 1383 selfloop transitions, 3101 changer transitions 7/4491 dead transitions. [2022-12-13 19:52:32,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 4491 transitions, 100427 flow [2022-12-13 19:52:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-13 19:52:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-13 19:52:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 15567 transitions. [2022-12-13 19:52:32,466 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37879598987736035 [2022-12-13 19:52:32,466 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 15567 transitions. [2022-12-13 19:52:32,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 15567 transitions. [2022-12-13 19:52:32,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:52:32,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 15567 transitions. [2022-12-13 19:52:32,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 176.89772727272728) internal successors, (15567), 88 states have internal predecessors, (15567), 0 states have call successors, (0), 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:52:32,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 467.0) internal successors, (41563), 89 states have internal predecessors, (41563), 0 states have call successors, (0), 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:52:32,545 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 467.0) internal successors, (41563), 89 states have internal predecessors, (41563), 0 states have call successors, (0), 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:52:32,545 INFO L175 Difference]: Start difference. First operand has 372 places, 2171 transitions, 46259 flow. Second operand 88 states and 15567 transitions. [2022-12-13 19:52:32,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 4491 transitions, 100427 flow [2022-12-13 19:52:42,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 4491 transitions, 95064 flow, removed 2482 selfloop flow, removed 9 redundant places. [2022-12-13 19:52:42,148 INFO L231 Difference]: Finished difference. Result has 473 places, 3988 transitions, 90824 flow [2022-12-13 19:52:42,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=43316, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=90824, PETRI_PLACES=473, PETRI_TRANSITIONS=3988} [2022-12-13 19:52:42,149 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 441 predicate places. [2022-12-13 19:52:42,149 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 3988 transitions, 90824 flow [2022-12-13 19:52:42,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 172.57142857142858) internal successors, (4832), 28 states have internal predecessors, (4832), 0 states have call successors, (0), 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:52:42,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:52:42,150 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, 1, 1] [2022-12-13 19:52:42,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 19:52:42,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:52:42,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:52:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:52:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1883102244, now seen corresponding path program 12 times [2022-12-13 19:52:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:52:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435706591] [2022-12-13 19:52:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:52:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:52:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:52:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:52:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:52:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435706591] [2022-12-13 19:52:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435706591] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:52:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920627046] [2022-12-13 19:52:43,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:52:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:52:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:52:43,401 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:52:43,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 19:52:43,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 19:52:43,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:52:43,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 19:52:43,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:52:43,613 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:52:43,685 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:52:43,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:52:43,988 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 51 treesize of output 45 [2022-12-13 19:52:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:52:44,247 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 51 treesize of output 45 [2022-12-13 19:52:44,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:44,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:44,688 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 94 treesize of output 53 [2022-12-13 19:52:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:52:44,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:52:47,569 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (+ c_~mts1~0 .cse2))) (or (< .cse0 0) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ c_~mts3~0 .cse1) 0)) (< (+ c_~sum~0 c_~mts2~0 .cse1) (+ c_~mts1~0 .cse2 1))))) (not (<= .cse0 2147483647))))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse4 (+ c_~mts1~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse4 0) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse5 (+ c_~mts3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse5 .cse4) (< .cse5 0)))) (not (<= .cse4 2147483647)))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse8 (+ c_~mts1~0 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))) (< .cse8 0) (= .cse8 0) (not (<= .cse8 2147483647)))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ c_~mts1~0 .cse9 2147483648))) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ c_~mts3~0 .cse10) 0)) (< (+ c_~sum~0 c_~mts2~0 .cse10) 1)))) (not (< (+ c_~mts1~0 .cse9) 0)))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ c_~mts1~0 .cse12 2147483648))) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse13 (+ c_~mts3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (< .cse13 0) (= .cse13 0)))) (not (< (+ c_~mts1~0 .cse12) 0)))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse15 (+ c_~mts1~0 .cse17))) (or (< .cse15 0) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ c_~mts3~0 .cse16) 0) (< (+ c_~sum~0 c_~mts2~0 .cse16) (+ c_~mts1~0 .cse17 1))))) (not (<= .cse15 2147483647))))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_675))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ c_~mts1~0 .cse19 2147483648))) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (let ((.cse20 (select (select (store (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ c_~mts3~0 .cse20) 0) (< (+ c_~sum~0 c_~mts2~0 .cse20) 1)))) (not (< (+ c_~mts1~0 .cse19) 0)))))) (< ~M~0 0)))) is different from false [2022-12-13 19:52:47,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:47,642 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 109 treesize of output 73 [2022-12-13 19:52:47,658 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,658 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 1493 treesize of output 1421 [2022-12-13 19:52:47,677 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 1350 treesize of output 1158 [2022-12-13 19:52:47,689 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 1158 treesize of output 1062 [2022-12-13 19:52:47,709 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,710 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 1109 treesize of output 1059 [2022-12-13 19:52:47,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:47,843 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 121 treesize of output 85 [2022-12-13 19:52:47,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:47,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:47,861 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,861 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 127 treesize of output 107 [2022-12-13 19:52:47,875 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,876 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 82 treesize of output 70 [2022-12-13 19:52:47,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:47,947 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 122 treesize of output 86 [2022-12-13 19:52:47,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:47,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:47,967 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,967 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 130 treesize of output 110 [2022-12-13 19:52:47,984 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:47,984 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 95 treesize of output 83 [2022-12-13 19:52:48,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:48,045 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 142 treesize of output 94 [2022-12-13 19:52:48,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,065 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,065 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 195 treesize of output 159 [2022-12-13 19:52:48,084 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,084 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 143 treesize of output 121 [2022-12-13 19:52:48,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:48,148 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 120 treesize of output 84 [2022-12-13 19:52:48,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,168 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,168 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 125 treesize of output 105 [2022-12-13 19:52:48,182 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,183 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 81 treesize of output 69 [2022-12-13 19:52:48,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:48,235 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 139 treesize of output 91 [2022-12-13 19:52:48,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,255 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,255 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 184 treesize of output 148 [2022-12-13 19:52:48,273 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,273 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 120 treesize of output 98 [2022-12-13 19:52:48,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:52:48,392 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 141 treesize of output 93 [2022-12-13 19:52:48,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:52:48,411 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,411 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 192 treesize of output 156 [2022-12-13 19:52:48,428 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:48,428 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 130 treesize of output 108 [2022-12-13 19:52:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 19:52:48,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920627046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:52:48,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:52:48,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-12-13 19:52:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650517891] [2022-12-13 19:52:48,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:52:48,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 19:52:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:52:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 19:52:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1184, Unknown=12, NotChecked=70, Total=1406 [2022-12-13 19:52:48,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 467 [2022-12-13 19:52:48,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 3988 transitions, 90824 flow. Second operand has 38 states, 38 states have (on average 134.89473684210526) internal successors, (5126), 38 states have internal predecessors, (5126), 0 states have call successors, (0), 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:52:48,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:52:48,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 467 [2022-12-13 19:52:48,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:53:06,582 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 53 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:53:18,477 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 101 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:53:42,319 INFO L130 PetriNetUnfolder]: 21686/32026 cut-off events. [2022-12-13 19:53:42,320 INFO L131 PetriNetUnfolder]: For 879488/879488 co-relation queries the response was YES. [2022-12-13 19:53:42,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323541 conditions, 32026 events. 21686/32026 cut-off events. For 879488/879488 co-relation queries the response was YES. Maximal size of possible extension queue 2032. Compared 219615 event pairs, 2030 based on Foata normal form. 2/32028 useless extension candidates. Maximal degree in co-relation 323240. Up to 20960 conditions per place. [2022-12-13 19:53:42,980 INFO L137 encePairwiseOnDemand]: 453/467 looper letters, 1794 selfloop transitions, 2538 changer transitions 2/4334 dead transitions. [2022-12-13 19:53:42,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 4334 transitions, 104900 flow [2022-12-13 19:53:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 19:53:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 19:53:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3294 transitions. [2022-12-13 19:53:42,986 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30667535611209384 [2022-12-13 19:53:42,987 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3294 transitions. [2022-12-13 19:53:42,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3294 transitions. [2022-12-13 19:53:42,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:53:42,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3294 transitions. [2022-12-13 19:53:42,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 143.2173913043478) internal successors, (3294), 23 states have internal predecessors, (3294), 0 states have call successors, (0), 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:53:43,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 467.0) internal successors, (11208), 24 states have internal predecessors, (11208), 0 states have call successors, (0), 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:53:43,002 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 467.0) internal successors, (11208), 24 states have internal predecessors, (11208), 0 states have call successors, (0), 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:53:43,002 INFO L175 Difference]: Start difference. First operand has 473 places, 3988 transitions, 90824 flow. Second operand 23 states and 3294 transitions. [2022-12-13 19:53:43,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 4334 transitions, 104900 flow [2022-12-13 19:53:56,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 4334 transitions, 99977 flow, removed 2439 selfloop flow, removed 5 redundant places. [2022-12-13 19:53:56,600 INFO L231 Difference]: Finished difference. Result has 496 places, 4133 transitions, 94585 flow [2022-12-13 19:53:56,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=86151, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=94585, PETRI_PLACES=496, PETRI_TRANSITIONS=4133} [2022-12-13 19:53:56,602 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 464 predicate places. [2022-12-13 19:53:56,603 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 4133 transitions, 94585 flow [2022-12-13 19:53:56,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 134.89473684210526) internal successors, (5126), 38 states have internal predecessors, (5126), 0 states have call successors, (0), 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:53:56,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:53:56,603 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, 1, 1] [2022-12-13 19:53:56,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 19:53:56,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 19:53:56,805 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 19:53:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1715956338, now seen corresponding path program 13 times [2022-12-13 19:53:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:53:56,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002272476] [2022-12-13 19:53:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:56,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:53:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:53:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:53:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002272476] [2022-12-13 19:53:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002272476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831308847] [2022-12-13 19:53:58,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:53:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:53:58,486 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:53:58,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500daae5-25d1-484b-b6a4-1d7e72c88ca9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 19:53:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:58,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 19:53:58,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:58,653 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:53:58,737 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:53:59,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:59,150 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 51 treesize of output 45 [2022-12-13 19:53:59,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:59,359 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 51 treesize of output 45 [2022-12-13 19:53:59,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:53:59,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:53:59,731 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 94 treesize of output 53 [2022-12-13 19:54:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:00,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:54:01,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse0 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0))) (and (or (not .cse0) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3))) (let ((.cse1 (+ c_~mts3~0 .cse2))) (or (= .cse1 0) (= (+ c_~sum~0 c_~mts2~0 .cse2) 0) (< .cse1 0))))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3)) 0)) (or .cse4 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse5 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3)))) (or (= .cse5 0) (< .cse5 0)))))) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648)))) (or (let ((.cse6 (+ (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) c_~mts1~0))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3)) .cse6)) (or (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse7 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3)))) (or (= .cse6 .cse7) (< .cse7 0)))) .cse4) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3))) (let ((.cse9 (+ c_~mts3~0 .cse8))) (or (= .cse6 (+ c_~sum~0 c_~mts2~0 .cse8)) (= .cse6 .cse9) (< .cse9 0))))) (or (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse10)) (not (< (+ c_~mts3~0 .cse10) 0))))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_726) c_~A~0.base) .cse3))) (or (= .cse6 (+ c_~sum~0 c_~mts2~0 .cse11)) (not (< (+ c_~mts3~0 .cse11) 0)))))) (= .cse6 0)))) .cse0 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647))))) is different from false [2022-12-13 19:54:21,633 WARN L233 SmtUtils]: Spent 18.85s on a formula simplification. DAG size of input: 97 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:54:21,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:21,724 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 195 treesize of output 123 [2022-12-13 19:54:21,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:21,752 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 8229 treesize of output 7399 [2022-12-13 19:54:21,794 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 7344 treesize of output 6384 [2022-12-13 19:54:21,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:21,850 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 6419 treesize of output 5929 [2022-12-13 19:54:21,891 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 5888 treesize of output 5408