./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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-38b53e6 [2022-11-25 18:15:03,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:15:03,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:15:03,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:15:03,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:15:03,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:15:03,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:15:03,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:15:03,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:15:03,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:15:03,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:15:03,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:15:03,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:15:03,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:15:03,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:15:03,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:15:03,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:15:03,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:15:03,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:15:03,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:15:03,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:15:03,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:15:03,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:15:03,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:15:03,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:15:03,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:15:03,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:15:03,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:15:03,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:15:03,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:15:03,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:15:03,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:15:03,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:15:03,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:15:03,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:15:03,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:15:03,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:15:03,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:15:03,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:15:03,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:15:03,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:15:03,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 18:15:03,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:15:03,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:15:03,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:15:03,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:15:03,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:15:03,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:15:03,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:15:03,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:15:03,893 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:15:03,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:15:03,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:15:03,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:15:03,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:15:03,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:15:03,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:15:03,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:15:03,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:15:03,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:15:03,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:15:03,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:15:03,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:15:03,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:15:03,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:15:03,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:15:03,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:15:03,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:15:03,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:15:03,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:15:03,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:15:03,900 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:15:03,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:15:03,900 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R 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 ! overflow) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-25 18:15:04,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:15:04,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:15:04,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:15:04,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:15:04,218 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:15:04,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 18:15:07,462 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:15:07,782 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:15:07,783 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 18:15:07,802 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/data/1d2f527a7/a8857b76cf24483fbabc80baa0bdef68/FLAG0e347cb89 [2022-11-25 18:15:07,848 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/data/1d2f527a7/a8857b76cf24483fbabc80baa0bdef68 [2022-11-25 18:15:07,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:15:07,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:15:07,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:15:07,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:15:07,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:15:07,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:15:07" (1/1) ... [2022-11-25 18:15:07,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166927ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:07, skipping insertion in model container [2022-11-25 18:15:07,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:15:07" (1/1) ... [2022-11-25 18:15:07,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:15:07,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:15:08,444 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 18:15:08,447 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 18:15:08,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:15:08,467 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:15:08,520 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 18:15:08,523 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_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 18:15:08,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:15:08,584 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:15:08,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08 WrapperNode [2022-11-25 18:15:08,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:15:08,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:15:08,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:15:08,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:15:08,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,642 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 18:15:08,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:15:08,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:15:08,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:15:08,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:15:08,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,687 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:15:08,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:15:08,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:15:08,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:15:08,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (1/1) ... [2022-11-25 18:15:08,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:15:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:15:08,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:15:08,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:15:08,773 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:15:08,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:15:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:15:08,774 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:15:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:15:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:15:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:15:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:15:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:15:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:15:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:15:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:15:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:15:08,777 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:15:08,956 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:15:08,958 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:15:09,452 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:15:09,462 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:15:09,463 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:15:09,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:15:09 BoogieIcfgContainer [2022-11-25 18:15:09,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:15:09,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:15:09,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:15:09,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:15:09,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:15:07" (1/3) ... [2022-11-25 18:15:09,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2f9020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:15:09, skipping insertion in model container [2022-11-25 18:15:09,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:08" (2/3) ... [2022-11-25 18:15:09,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2f9020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:15:09, skipping insertion in model container [2022-11-25 18:15:09,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:15:09" (3/3) ... [2022-11-25 18:15:09,475 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-25 18:15:09,484 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:15:09,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:15:09,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 18:15:09,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:15:09,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:15:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 18:15:09,902 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-25 18:15:09,903 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:15:09,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 18:15:09,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 18:15:09,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-25 18:15:09,931 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:15:09,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 18:15:09,971 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 18:15:09,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-11-25 18:15:10,044 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-11-25 18:15:10,044 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:15:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 239 events. 13/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 373 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 18:15:10,054 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-25 18:15:22,989 INFO L134 LiptonReduction]: Checked pairs total: 31775 [2022-11-25 18:15:22,990 INFO L136 LiptonReduction]: Total number of compositions: 227 [2022-11-25 18:15:23,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:15:23,019 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;@11996abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:15:23,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 18:15:23,026 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-11-25 18:15:23,026 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:15:23,027 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:23,027 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:23,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1252954978, now seen corresponding path program 1 times [2022-11-25 18:15:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:23,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992212927] [2022-11-25 18:15:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:24,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992212927] [2022-11-25 18:15:24,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992212927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:24,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:24,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464722819] [2022-11-25 18:15:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:24,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:15:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:15:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:15:25,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 18:15:25,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:25,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:25,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 18:15:25,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:25,797 INFO L130 PetriNetUnfolder]: 1630/2709 cut-off events. [2022-11-25 18:15:25,797 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 18:15:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 2709 events. 1630/2709 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13810 event pairs, 1187 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 5193. Up to 2621 conditions per place. [2022-11-25 18:15:25,823 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-11-25 18:15:25,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 281 flow [2022-11-25 18:15:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:15:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:15:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1192 transitions. [2022-11-25 18:15:25,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2022-11-25 18:15:25,853 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1192 transitions. [2022-11-25 18:15:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1192 transitions. [2022-11-25 18:15:25,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:25,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1192 transitions. [2022-11-25 18:15:25,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.4) internal successors, (1192), 5 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:25,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:25,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:25,890 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 5 states and 1192 transitions. [2022-11-25 18:15:25,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 281 flow [2022-11-25 18:15:25,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:15:25,901 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 169 flow [2022-11-25 18:15:25,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2022-11-25 18:15:25,908 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2022-11-25 18:15:25,909 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 169 flow [2022-11-25 18:15:25,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:25,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:25,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:25,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:15:25,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash 186648025, now seen corresponding path program 1 times [2022-11-25 18:15:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:25,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808118727] [2022-11-25 18:15:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808118727] [2022-11-25 18:15:26,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808118727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:26,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:15:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280570580] [2022-11-25 18:15:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:15:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:15:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:15:27,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 478 [2022-11-25 18:15:27,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:27,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:27,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 478 [2022-11-25 18:15:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:27,958 INFO L130 PetriNetUnfolder]: 2830/4694 cut-off events. [2022-11-25 18:15:27,958 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-11-25 18:15:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9706 conditions, 4694 events. 2830/4694 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27442 event pairs, 431 based on Foata normal form. 0/3567 useless extension candidates. Maximal degree in co-relation 7230. Up to 2639 conditions per place. [2022-11-25 18:15:27,990 INFO L137 encePairwiseOnDemand]: 467/478 looper letters, 127 selfloop transitions, 17 changer transitions 0/150 dead transitions. [2022-11-25 18:15:27,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 150 transitions, 646 flow [2022-11-25 18:15:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:15:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:15:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1246 transitions. [2022-11-25 18:15:27,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5213389121338912 [2022-11-25 18:15:27,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1246 transitions. [2022-11-25 18:15:27,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1246 transitions. [2022-11-25 18:15:27,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:27,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1246 transitions. [2022-11-25 18:15:27,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.2) internal successors, (1246), 5 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:28,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:28,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:28,007 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 169 flow. Second operand 5 states and 1246 transitions. [2022-11-25 18:15:28,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 150 transitions, 646 flow [2022-11-25 18:15:28,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 150 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:15:28,019 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 287 flow [2022-11-25 18:15:28,020 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2022-11-25 18:15:28,021 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2022-11-25 18:15:28,021 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 287 flow [2022-11-25 18:15:28,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:28,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:28,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:28,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:15:28,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 186900986, now seen corresponding path program 1 times [2022-11-25 18:15:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:28,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376605703] [2022-11-25 18:15:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:29,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376605703] [2022-11-25 18:15:29,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376605703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:29,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:29,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:15:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750690754] [2022-11-25 18:15:29,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:29,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:15:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:15:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:15:29,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 18:15:29,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:29,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:29,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 18:15:29,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:31,328 INFO L130 PetriNetUnfolder]: 2899/4834 cut-off events. [2022-11-25 18:15:31,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-11-25 18:15:31,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11067 conditions, 4834 events. 2899/4834 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 28169 event pairs, 921 based on Foata normal form. 93/3823 useless extension candidates. Maximal degree in co-relation 8603. Up to 3690 conditions per place. [2022-11-25 18:15:31,367 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 119 selfloop transitions, 14 changer transitions 0/139 dead transitions. [2022-11-25 18:15:31,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 139 transitions, 696 flow [2022-11-25 18:15:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:15:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:15:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2022-11-25 18:15:31,372 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2022-11-25 18:15:31,372 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1238 transitions. [2022-11-25 18:15:31,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1238 transitions. [2022-11-25 18:15:31,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:31,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1238 transitions. [2022-11-25 18:15:31,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.6) internal successors, (1238), 5 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:31,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:31,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:31,385 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 287 flow. Second operand 5 states and 1238 transitions. [2022-11-25 18:15:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 139 transitions, 696 flow [2022-11-25 18:15:31,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 139 transitions, 682 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-11-25 18:15:31,402 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 337 flow [2022-11-25 18:15:31,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2022-11-25 18:15:31,405 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2022-11-25 18:15:31,405 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 337 flow [2022-11-25 18:15:31,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:31,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:31,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:31,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:15:31,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1122777527, now seen corresponding path program 1 times [2022-11-25 18:15:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:31,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682630819] [2022-11-25 18:15:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:31,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682630819] [2022-11-25 18:15:31,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682630819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:31,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:31,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473397207] [2022-11-25 18:15:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:31,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:15:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:15:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:15:31,515 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 18:15:31,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:31,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:31,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 18:15:31,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:32,843 INFO L130 PetriNetUnfolder]: 4945/8070 cut-off events. [2022-11-25 18:15:32,843 INFO L131 PetriNetUnfolder]: For 4150/4150 co-relation queries the response was YES. [2022-11-25 18:15:32,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18979 conditions, 8070 events. 4945/8070 cut-off events. For 4150/4150 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 49865 event pairs, 2473 based on Foata normal form. 0/6166 useless extension candidates. Maximal degree in co-relation 15085. Up to 4857 conditions per place. [2022-11-25 18:15:32,906 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 160 selfloop transitions, 4 changer transitions 0/169 dead transitions. [2022-11-25 18:15:32,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 169 transitions, 1026 flow [2022-11-25 18:15:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:15:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:15:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1053 transitions. [2022-11-25 18:15:32,911 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5507322175732218 [2022-11-25 18:15:32,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1053 transitions. [2022-11-25 18:15:32,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1053 transitions. [2022-11-25 18:15:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:32,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1053 transitions. [2022-11-25 18:15:32,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:32,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:32,928 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:32,928 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 337 flow. Second operand 4 states and 1053 transitions. [2022-11-25 18:15:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 169 transitions, 1026 flow [2022-11-25 18:15:32,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1008 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:15:32,946 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 360 flow [2022-11-25 18:15:32,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2022-11-25 18:15:32,949 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2022-11-25 18:15:32,949 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 360 flow [2022-11-25 18:15:32,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:32,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:32,950 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:32,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:15:32,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash -782335366, now seen corresponding path program 1 times [2022-11-25 18:15:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:32,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080867546] [2022-11-25 18:15:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:34,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080867546] [2022-11-25 18:15:34,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080867546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:34,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:34,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:15:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624153384] [2022-11-25 18:15:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:34,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:15:34,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:15:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:15:34,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 18:15:34,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:34,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:34,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 18:15:34,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:36,502 INFO L130 PetriNetUnfolder]: 5105/8496 cut-off events. [2022-11-25 18:15:36,502 INFO L131 PetriNetUnfolder]: For 4510/4516 co-relation queries the response was YES. [2022-11-25 18:15:36,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20733 conditions, 8496 events. 5105/8496 cut-off events. For 4510/4516 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 54264 event pairs, 2736 based on Foata normal form. 0/6881 useless extension candidates. Maximal degree in co-relation 13114. Up to 7011 conditions per place. [2022-11-25 18:15:36,557 INFO L137 encePairwiseOnDemand]: 466/478 looper letters, 103 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2022-11-25 18:15:36,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 746 flow [2022-11-25 18:15:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:15:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:15:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1450 transitions. [2022-11-25 18:15:36,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5055788005578801 [2022-11-25 18:15:36,564 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1450 transitions. [2022-11-25 18:15:36,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1450 transitions. [2022-11-25 18:15:36,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:36,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1450 transitions. [2022-11-25 18:15:36,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.66666666666666) internal successors, (1450), 6 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:36,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:36,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:36,577 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 360 flow. Second operand 6 states and 1450 transitions. [2022-11-25 18:15:36,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 746 flow [2022-11-25 18:15:36,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:15:36,594 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 490 flow [2022-11-25 18:15:36,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2022-11-25 18:15:36,595 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2022-11-25 18:15:36,595 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 490 flow [2022-11-25 18:15:36,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:36,596 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:36,597 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:36,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:15:36,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1554621182, now seen corresponding path program 1 times [2022-11-25 18:15:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:36,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100187967] [2022-11-25 18:15:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:37,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100187967] [2022-11-25 18:15:37,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100187967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:37,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:37,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:15:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249291700] [2022-11-25 18:15:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:37,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:15:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:15:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:15:38,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 18:15:38,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 490 flow. Second operand has 7 states, 7 states have (on average 223.57142857142858) internal successors, (1565), 7 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:38,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:38,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 18:15:38,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:40,553 INFO L130 PetriNetUnfolder]: 5332/8885 cut-off events. [2022-11-25 18:15:40,553 INFO L131 PetriNetUnfolder]: For 6208/6240 co-relation queries the response was YES. [2022-11-25 18:15:40,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23522 conditions, 8885 events. 5332/8885 cut-off events. For 6208/6240 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 57430 event pairs, 1352 based on Foata normal form. 147/7852 useless extension candidates. Maximal degree in co-relation 17786. Up to 7030 conditions per place. [2022-11-25 18:15:40,626 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 139 selfloop transitions, 16 changer transitions 0/161 dead transitions. [2022-11-25 18:15:40,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 161 transitions, 1003 flow [2022-11-25 18:15:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:15:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:15:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2022-11-25 18:15:40,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2022-11-25 18:15:40,634 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1238 transitions. [2022-11-25 18:15:40,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1238 transitions. [2022-11-25 18:15:40,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:40,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1238 transitions. [2022-11-25 18:15:40,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.6) internal successors, (1238), 5 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:40,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:40,648 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:40,648 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 490 flow. Second operand 5 states and 1238 transitions. [2022-11-25 18:15:40,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 161 transitions, 1003 flow [2022-11-25 18:15:40,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 161 transitions, 991 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 18:15:40,717 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 542 flow [2022-11-25 18:15:40,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=542, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2022-11-25 18:15:40,720 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2022-11-25 18:15:40,721 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 542 flow [2022-11-25 18:15:40,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 223.57142857142858) internal successors, (1565), 7 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:40,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:40,722 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:40,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:15:40,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash 161938586, now seen corresponding path program 2 times [2022-11-25 18:15:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:40,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105495999] [2022-11-25 18:15:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105495999] [2022-11-25 18:15:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105495999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:41,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:41,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:15:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851898870] [2022-11-25 18:15:41,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:41,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:15:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:15:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:15:41,855 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 18:15:41,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:41,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:41,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 18:15:41,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:43,111 INFO L130 PetriNetUnfolder]: 5957/9931 cut-off events. [2022-11-25 18:15:43,112 INFO L131 PetriNetUnfolder]: For 9410/9458 co-relation queries the response was YES. [2022-11-25 18:15:43,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27288 conditions, 9931 events. 5957/9931 cut-off events. For 9410/9458 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 63911 event pairs, 1654 based on Foata normal form. 196/8852 useless extension candidates. Maximal degree in co-relation 20478. Up to 6862 conditions per place. [2022-11-25 18:15:43,168 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 142 selfloop transitions, 19 changer transitions 0/167 dead transitions. [2022-11-25 18:15:43,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 167 transitions, 1105 flow [2022-11-25 18:15:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:15:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:15:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1242 transitions. [2022-11-25 18:15:43,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196652719665272 [2022-11-25 18:15:43,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1242 transitions. [2022-11-25 18:15:43,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1242 transitions. [2022-11-25 18:15:43,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:43,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1242 transitions. [2022-11-25 18:15:43,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 248.4) internal successors, (1242), 5 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,185 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,185 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 542 flow. Second operand 5 states and 1242 transitions. [2022-11-25 18:15:43,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 167 transitions, 1105 flow [2022-11-25 18:15:43,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 167 transitions, 1073 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 18:15:43,284 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 619 flow [2022-11-25 18:15:43,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=619, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2022-11-25 18:15:43,285 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2022-11-25 18:15:43,285 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 619 flow [2022-11-25 18:15:43,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,286 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:43,287 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:43,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:15:43,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 952571989, now seen corresponding path program 1 times [2022-11-25 18:15:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:43,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886616794] [2022-11-25 18:15:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:43,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886616794] [2022-11-25 18:15:43,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886616794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:43,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:43,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:15:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227414729] [2022-11-25 18:15:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:43,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 478 [2022-11-25 18:15:43,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:43,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 478 [2022-11-25 18:15:43,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:43,666 INFO L130 PetriNetUnfolder]: 1049/2005 cut-off events. [2022-11-25 18:15:43,666 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2022-11-25 18:15:43,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 2005 events. 1049/2005 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11585 event pairs, 735 based on Foata normal form. 106/1856 useless extension candidates. Maximal degree in co-relation 4280. Up to 1151 conditions per place. [2022-11-25 18:15:43,676 INFO L137 encePairwiseOnDemand]: 474/478 looper letters, 80 selfloop transitions, 2 changer transitions 8/94 dead transitions. [2022-11-25 18:15:43,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 665 flow [2022-11-25 18:15:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:15:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2022-11-25 18:15:43,686 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5362622036262203 [2022-11-25 18:15:43,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2022-11-25 18:15:43,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2022-11-25 18:15:43,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:43,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2022-11-25 18:15:43,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,694 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 619 flow. Second operand 3 states and 769 transitions. [2022-11-25 18:15:43,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 665 flow [2022-11-25 18:15:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 641 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 18:15:43,706 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 431 flow [2022-11-25 18:15:43,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2022-11-25 18:15:43,707 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2022-11-25 18:15:43,708 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 431 flow [2022-11-25 18:15:43,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:43,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:43,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:43,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:15:43,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1686342842, now seen corresponding path program 1 times [2022-11-25 18:15:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:43,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671841928] [2022-11-25 18:15:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:44,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671841928] [2022-11-25 18:15:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671841928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:44,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:44,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:15:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745572968] [2022-11-25 18:15:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:44,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:15:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:15:44,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:15:45,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 18:15:45,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:45,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 18:15:45,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:45,841 INFO L130 PetriNetUnfolder]: 955/1848 cut-off events. [2022-11-25 18:15:45,841 INFO L131 PetriNetUnfolder]: For 1206/1206 co-relation queries the response was YES. [2022-11-25 18:15:45,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 1848 events. 955/1848 cut-off events. For 1206/1206 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10632 event pairs, 334 based on Foata normal form. 18/1650 useless extension candidates. Maximal degree in co-relation 4069. Up to 997 conditions per place. [2022-11-25 18:15:45,850 INFO L137 encePairwiseOnDemand]: 467/478 looper letters, 101 selfloop transitions, 17 changer transitions 0/123 dead transitions. [2022-11-25 18:15:45,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 123 transitions, 792 flow [2022-11-25 18:15:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:15:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:15:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1439 transitions. [2022-11-25 18:15:45,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017433751743375 [2022-11-25 18:15:45,861 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1439 transitions. [2022-11-25 18:15:45,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1439 transitions. [2022-11-25 18:15:45,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:45,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1439 transitions. [2022-11-25 18:15:45,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,896 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,896 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 431 flow. Second operand 6 states and 1439 transitions. [2022-11-25 18:15:45,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 123 transitions, 792 flow [2022-11-25 18:15:45,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 123 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:15:45,907 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 500 flow [2022-11-25 18:15:45,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2022-11-25 18:15:45,909 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2022-11-25 18:15:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 83 transitions, 500 flow [2022-11-25 18:15:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:45,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:45,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:15:45,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2060660023, now seen corresponding path program 1 times [2022-11-25 18:15:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814783614] [2022-11-25 18:15:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:45,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814783614] [2022-11-25 18:15:45,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814783614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:45,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:45,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267585739] [2022-11-25 18:15:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:45,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:15:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:15:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:15:45,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 18:15:45,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 83 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:45,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:45,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 18:15:45,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:15:46,360 INFO L130 PetriNetUnfolder]: 840/1593 cut-off events. [2022-11-25 18:15:46,361 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-11-25 18:15:46,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1593 events. 840/1593 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8227 event pairs, 615 based on Foata normal form. 10/1400 useless extension candidates. Maximal degree in co-relation 3853. Up to 1157 conditions per place. [2022-11-25 18:15:46,370 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 93 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2022-11-25 18:15:46,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 752 flow [2022-11-25 18:15:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:15:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:15:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2022-11-25 18:15:46,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251046025104602 [2022-11-25 18:15:46,374 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1004 transitions. [2022-11-25 18:15:46,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1004 transitions. [2022-11-25 18:15:46,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:15:46,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1004 transitions. [2022-11-25 18:15:46,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:46,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:46,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:46,382 INFO L175 Difference]: Start difference. First operand has 95 places, 83 transitions, 500 flow. Second operand 4 states and 1004 transitions. [2022-11-25 18:15:46,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 752 flow [2022-11-25 18:15:46,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 101 transitions, 734 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-25 18:15:46,393 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 511 flow [2022-11-25 18:15:46,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2022-11-25 18:15:46,395 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2022-11-25 18:15:46,395 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 511 flow [2022-11-25 18:15:46,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:46,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:15:46,396 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:46,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:15:46,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:15:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186174, now seen corresponding path program 1 times [2022-11-25 18:15:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348465476] [2022-11-25 18:15:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:46,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348465476] [2022-11-25 18:15:46,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348465476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854047449] [2022-11-25 18:15:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:46,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:15:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:15:46,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:15:46,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:15:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:47,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 18:15:47,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:15:47,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:15:47,201 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:15:47,203 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:15:47,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:15:47,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:15:47,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:15:47,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 37 [2022-11-25 18:15:47,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:15:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:15:47,987 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 45 treesize of output 47 [2022-11-25 18:15:48,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 56 [2022-11-25 18:15:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:48,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:15:48,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_409) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2022-11-25 18:15:48,830 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_406 Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_402)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_405) .cse1 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_406) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_409) (+ 88 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_405 2147483648) 0))))) is different from false [2022-11-25 18:15:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 18:15:49,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854047449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:15:49,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:15:49,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-11-25 18:15:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832960566] [2022-11-25 18:15:49,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:15:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 18:15:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 18:15:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=442, Unknown=17, NotChecked=94, Total=702 [2022-11-25 18:15:49,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 478 [2022-11-25 18:15:49,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 511 flow. Second operand has 27 states, 27 states have (on average 186.77777777777777) internal successors, (5043), 27 states have internal predecessors, (5043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:49,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:15:49,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 478 [2022-11-25 18:15:49,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:16:03,245 INFO L130 PetriNetUnfolder]: 1875/3638 cut-off events. [2022-11-25 18:16:03,245 INFO L131 PetriNetUnfolder]: For 2646/2646 co-relation queries the response was YES. [2022-11-25 18:16:03,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 3638 events. 1875/3638 cut-off events. For 2646/2646 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22101 event pairs, 642 based on Foata normal form. 33/3242 useless extension candidates. Maximal degree in co-relation 7558. Up to 1098 conditions per place. [2022-11-25 18:16:03,262 INFO L137 encePairwiseOnDemand]: 458/478 looper letters, 208 selfloop transitions, 77 changer transitions 0/290 dead transitions. [2022-11-25 18:16:03,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 290 transitions, 1907 flow [2022-11-25 18:16:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:16:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-25 18:16:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4700 transitions. [2022-11-25 18:16:03,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4096931659693166 [2022-11-25 18:16:03,278 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4700 transitions. [2022-11-25 18:16:03,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4700 transitions. [2022-11-25 18:16:03,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:16:03,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4700 transitions. [2022-11-25 18:16:03,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 195.83333333333334) internal successors, (4700), 24 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:03,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:03,317 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:03,318 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 511 flow. Second operand 24 states and 4700 transitions. [2022-11-25 18:16:03,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 290 transitions, 1907 flow [2022-11-25 18:16:03,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 290 transitions, 1902 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:16:03,334 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 1184 flow [2022-11-25 18:16:03,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1184, PETRI_PLACES=129, PETRI_TRANSITIONS=144} [2022-11-25 18:16:03,335 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 70 predicate places. [2022-11-25 18:16:03,335 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 1184 flow [2022-11-25 18:16:03,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 186.77777777777777) internal successors, (5043), 27 states have internal predecessors, (5043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:03,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:16:03,338 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:03,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:03,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:03,544 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:16:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash -467119801, now seen corresponding path program 1 times [2022-11-25 18:16:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:03,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920599910] [2022-11-25 18:16:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920599910] [2022-11-25 18:16:05,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920599910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314718008] [2022-11-25 18:16:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:05,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:05,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:05,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:16:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:05,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 18:16:05,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:05,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:05,946 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:16:05,947 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:16:05,985 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:16:05,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:16:06,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 36 [2022-11-25 18:16:06,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 73 treesize of output 66 [2022-11-25 18:16:06,605 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 60 treesize of output 62 [2022-11-25 18:16:06,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-25 18:16:06,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:06,918 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 41 treesize of output 43 [2022-11-25 18:16:07,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 52 [2022-11-25 18:16:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:07,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:07,387 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:16:07,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_509 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:16:07,458 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_509) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 18:16:07,484 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_509)))))) is different from false [2022-11-25 18:16:07,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 20) (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse2 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse0 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse0) 1) v_ArrVal_509)))))))) is different from false [2022-11-25 18:16:07,569 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_507)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_507 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_509)))))) (= (select .cse4 .cse2) 20))) is different from false [2022-11-25 18:16:07,625 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (= (select .cse0 .cse1) 20) (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse2 v_ArrVal_507)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse4 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse3 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse1 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse2) 1) v_ArrVal_507) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse3 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_509))))))))) is different from false [2022-11-25 18:16:07,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_504)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse4 v_ArrVal_507)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse2 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (= (select .cse1 .cse2) 20) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_509) (< (+ (select .cse1 .cse4) 1) v_ArrVal_507))))))) is different from false [2022-11-25 18:16:07,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (v_ArrVal_511 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int) (v_ArrVal_512 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_504))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_507)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_508))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_509)) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_507) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_512) .cse1) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_509) (= (select .cse0 .cse3) 20)))))))) is different from false [2022-11-25 18:16:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:16:07,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314718008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:07,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:07,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-25 18:16:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015401979] [2022-11-25 18:16:07,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:07,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 18:16:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 18:16:07,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=583, Unknown=9, NotChecked=540, Total=1332 [2022-11-25 18:16:08,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 18:16:08,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 144 transitions, 1184 flow. Second operand has 37 states, 37 states have (on average 177.3783783783784) internal successors, (6563), 37 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:08,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:16:08,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 18:16:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:16:14,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:16:16,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:16:21,143 INFO L130 PetriNetUnfolder]: 3135/6077 cut-off events. [2022-11-25 18:16:21,144 INFO L131 PetriNetUnfolder]: For 10973/10987 co-relation queries the response was YES. [2022-11-25 18:16:21,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20668 conditions, 6077 events. 3135/6077 cut-off events. For 10973/10987 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 41876 event pairs, 1094 based on Foata normal form. 44/5423 useless extension candidates. Maximal degree in co-relation 18128. Up to 3081 conditions per place. [2022-11-25 18:16:21,200 INFO L137 encePairwiseOnDemand]: 460/478 looper letters, 306 selfloop transitions, 67 changer transitions 0/378 dead transitions. [2022-11-25 18:16:21,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 378 transitions, 3270 flow [2022-11-25 18:16:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:16:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-11-25 18:16:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5916 transitions. [2022-11-25 18:16:21,216 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38676778242677823 [2022-11-25 18:16:21,216 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5916 transitions. [2022-11-25 18:16:21,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5916 transitions. [2022-11-25 18:16:21,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:16:21,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5916 transitions. [2022-11-25 18:16:21,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 184.875) internal successors, (5916), 32 states have internal predecessors, (5916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:21,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 478.0) internal successors, (15774), 33 states have internal predecessors, (15774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:21,262 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 478.0) internal successors, (15774), 33 states have internal predecessors, (15774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:21,262 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 1184 flow. Second operand 32 states and 5916 transitions. [2022-11-25 18:16:21,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 378 transitions, 3270 flow [2022-11-25 18:16:21,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 378 transitions, 3102 flow, removed 67 selfloop flow, removed 9 redundant places. [2022-11-25 18:16:21,327 INFO L231 Difference]: Finished difference. Result has 160 places, 189 transitions, 1569 flow [2022-11-25 18:16:21,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1569, PETRI_PLACES=160, PETRI_TRANSITIONS=189} [2022-11-25 18:16:21,331 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 101 predicate places. [2022-11-25 18:16:21,332 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 189 transitions, 1569 flow [2022-11-25 18:16:21,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 177.3783783783784) internal successors, (6563), 37 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:21,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:16:21,334 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:21,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:21,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:21,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:16:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash -397295570, now seen corresponding path program 1 times [2022-11-25 18:16:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:21,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790314667] [2022-11-25 18:16:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:21,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:22,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790314667] [2022-11-25 18:16:22,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790314667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:22,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244011571] [2022-11-25 18:16:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:22,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:22,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:22,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:16:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:23,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 18:16:23,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:23,081 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:16:23,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:16:23,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:16:23,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:23,310 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 18 treesize of output 20 [2022-11-25 18:16:23,408 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 25 treesize of output 24 [2022-11-25 18:16:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:23,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:16:23,568 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:16:23,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 18:16:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:23,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:23,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_599) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_601) (+ 88 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_601 2147483648) 0))) is different from false [2022-11-25 18:16:24,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:16:24,099 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 57 treesize of output 48 [2022-11-25 18:16:24,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:16:24,116 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 665 treesize of output 661 [2022-11-25 18:16:24,129 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 788 treesize of output 740 [2022-11-25 18:16:24,147 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 1276 treesize of output 1232 [2022-11-25 18:16:24,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:16:24,368 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 513 treesize of output 501 [2022-11-25 18:16:25,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:16:25,645 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 1482 treesize of output 1458 [2022-11-25 18:16:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244011571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:28,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-25 18:16:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336664238] [2022-11-25 18:16:28,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:28,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 18:16:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 18:16:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=567, Unknown=11, NotChecked=50, Total=756 [2022-11-25 18:16:29,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 478 [2022-11-25 18:16:29,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 189 transitions, 1569 flow. Second operand has 28 states, 28 states have (on average 182.82142857142858) internal successors, (5119), 28 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:29,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:16:29,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 478 [2022-11-25 18:16:29,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:16:31,513 INFO L130 PetriNetUnfolder]: 3335/6526 cut-off events. [2022-11-25 18:16:31,513 INFO L131 PetriNetUnfolder]: For 17524/17524 co-relation queries the response was YES. [2022-11-25 18:16:31,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24471 conditions, 6526 events. 3335/6526 cut-off events. For 17524/17524 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 45750 event pairs, 1437 based on Foata normal form. 44/5828 useless extension candidates. Maximal degree in co-relation 24000. Up to 2864 conditions per place. [2022-11-25 18:16:31,557 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 214 selfloop transitions, 36 changer transitions 0/255 dead transitions. [2022-11-25 18:16:31,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 255 transitions, 2444 flow [2022-11-25 18:16:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:16:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 18:16:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1939 transitions. [2022-11-25 18:16:31,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40564853556485353 [2022-11-25 18:16:31,563 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1939 transitions. [2022-11-25 18:16:31,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1939 transitions. [2022-11-25 18:16:31,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:16:31,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1939 transitions. [2022-11-25 18:16:31,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 193.9) internal successors, (1939), 10 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:31,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 478.0) internal successors, (5258), 11 states have internal predecessors, (5258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:31,575 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 478.0) internal successors, (5258), 11 states have internal predecessors, (5258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:31,575 INFO L175 Difference]: Start difference. First operand has 160 places, 189 transitions, 1569 flow. Second operand 10 states and 1939 transitions. [2022-11-25 18:16:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 255 transitions, 2444 flow [2022-11-25 18:16:31,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 255 transitions, 2290 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-11-25 18:16:31,642 INFO L231 Difference]: Finished difference. Result has 158 places, 190 transitions, 1503 flow [2022-11-25 18:16:31,643 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1503, PETRI_PLACES=158, PETRI_TRANSITIONS=190} [2022-11-25 18:16:31,643 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 99 predicate places. [2022-11-25 18:16:31,644 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 1503 flow [2022-11-25 18:16:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 182.82142857142858) internal successors, (5119), 28 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:31,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:16:31,645 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:31,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:31,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:16:31,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:16:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1141896803, now seen corresponding path program 2 times [2022-11-25 18:16:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907549381] [2022-11-25 18:16:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:34,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907549381] [2022-11-25 18:16:34,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907549381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:34,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512519204] [2022-11-25 18:16:34,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:16:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:34,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:34,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:16:34,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:16:34,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:34,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 18:16:34,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:34,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:34,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:34,492 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:16:34,492 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:16:34,518 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:16:34,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:16:34,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:16:34,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 46 [2022-11-25 18:16:35,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:16:35,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:35,297 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 45 treesize of output 47 [2022-11-25 18:16:35,404 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 45 treesize of output 47 [2022-11-25 18:16:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 56 [2022-11-25 18:16:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:35,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:36,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:16:37,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_697 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int) (v_ArrVal_699 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_697) .cse1 v_ArrVal_699)) |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_699) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_697))))) is different from false [2022-11-25 18:16:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 18:16:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512519204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:46,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-25 18:16:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5387873] [2022-11-25 18:16:46,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 18:16:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 18:16:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=861, Unknown=26, NotChecked=130, Total=1260 [2022-11-25 18:16:46,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 18:16:46,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 190 transitions, 1503 flow. Second operand has 36 states, 36 states have (on average 177.41666666666666) internal successors, (6387), 36 states have internal predecessors, (6387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:46,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:16:46,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 18:16:46,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:17:06,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:17:11,443 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (exists ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_90| Int) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_704 Int) (v_ArrVal_699 Int)) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_696))) (and (= .cse0 (store (store (store .cse1 .cse2 v_ArrVal_697) .cse3 v_ArrVal_699) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_90| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_704)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_90| v_ArrVal_699) (<= v_ArrVal_699 (+ (select .cse1 .cse3) 1)) (<= v_ArrVal_697 (+ (select .cse1 .cse2) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 0))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_697 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_699 Int)) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_696))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_697) .cse5 v_ArrVal_699)) |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse4 .cse5))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse7 .cse5))) (< (+ (select .cse8 .cse5) 1) v_ArrVal_699) (< (+ (select .cse8 .cse6) 1) v_ArrVal_697))))) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_704 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (select (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse9 .cse5)))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int) (v_ArrVal_699 Int)) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 v_ArrVal_699)) |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (select (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse6) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse10 .cse5)))))) (let ((.cse11 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not .cse11) (<= (select .cse7 84) 1) (<= (select .cse7 88) 1)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) (<= (select .cse12 88) 1) .cse11 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|)) (<= (select .cse12 84) 1))))))) is different from false [2022-11-25 18:17:13,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:17:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:17,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:22,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:22,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int) (v_ArrVal_699 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_699)) |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse0 .cse4)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 Int) (v_ArrVal_699 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_699)) |c_~#stored_elements~0.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse5 .cse4))) (not (<= v_ArrVal_699 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))))) is different from false [2022-11-25 18:17:24,222 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_704 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse0 .cse2)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_704 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_704) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse3 .cse2)))))))) is different from false [2022-11-25 18:17:25,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:29,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:30,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:17:31,209 INFO L130 PetriNetUnfolder]: 5109/10020 cut-off events. [2022-11-25 18:17:31,209 INFO L131 PetriNetUnfolder]: For 24784/24793 co-relation queries the response was YES. [2022-11-25 18:17:31,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37125 conditions, 10020 events. 5109/10020 cut-off events. For 24784/24793 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 77778 event pairs, 1905 based on Foata normal form. 26/8912 useless extension candidates. Maximal degree in co-relation 36201. Up to 3566 conditions per place. [2022-11-25 18:17:31,480 INFO L137 encePairwiseOnDemand]: 454/478 looper letters, 306 selfloop transitions, 153 changer transitions 2/466 dead transitions. [2022-11-25 18:17:31,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 466 transitions, 4353 flow [2022-11-25 18:17:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:17:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-25 18:17:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5602 transitions. [2022-11-25 18:17:31,489 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3906555090655509 [2022-11-25 18:17:31,489 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5602 transitions. [2022-11-25 18:17:31,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5602 transitions. [2022-11-25 18:17:31,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:17:31,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5602 transitions. [2022-11-25 18:17:31,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 186.73333333333332) internal successors, (5602), 30 states have internal predecessors, (5602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:17:31,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:17:31,519 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:17:31,519 INFO L175 Difference]: Start difference. First operand has 158 places, 190 transitions, 1503 flow. Second operand 30 states and 5602 transitions. [2022-11-25 18:17:31,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 466 transitions, 4353 flow [2022-11-25 18:17:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 466 transitions, 4317 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-25 18:17:31,615 INFO L231 Difference]: Finished difference. Result has 195 places, 286 transitions, 2881 flow [2022-11-25 18:17:31,616 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2881, PETRI_PLACES=195, PETRI_TRANSITIONS=286} [2022-11-25 18:17:31,616 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 136 predicate places. [2022-11-25 18:17:31,616 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 286 transitions, 2881 flow [2022-11-25 18:17:31,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 177.41666666666666) internal successors, (6387), 36 states have internal predecessors, (6387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:17:31,618 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:17:31,618 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:31,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:31,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:17:31,824 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:17:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1172030663, now seen corresponding path program 3 times [2022-11-25 18:17:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:31,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119905153] [2022-11-25 18:17:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:17:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:33,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119905153] [2022-11-25 18:17:33,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119905153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185395976] [2022-11-25 18:17:33,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:17:33,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:33,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:33,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:33,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:17:33,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 18:17:33,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:17:33,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 18:17:33,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:33,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:33,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:33,824 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:17:33,829 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:17:33,856 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:17:33,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:17:34,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:17:34,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 46 [2022-11-25 18:17:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:17:34,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:34,657 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 45 treesize of output 47 [2022-11-25 18:17:34,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 56 [2022-11-25 18:17:35,119 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 52 treesize of output 54 [2022-11-25 18:17:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:17:35,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:35,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 18:17:35,648 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| Int) (v_ArrVal_802 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_802)) |c_~#stored_elements~0.base| v_ArrVal_804))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_802 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| 4)) v_ArrVal_806)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 18:17:35,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| Int) (v_ArrVal_802 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_802)) |c_~#stored_elements~0.base| v_ArrVal_804))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_802) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| 4)) v_ArrVal_806)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 18:17:35,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| Int) (v_ArrVal_802 Int) (v_ArrVal_800 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_800) .cse2 v_ArrVal_802)) |c_~#stored_elements~0.base| v_ArrVal_804))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_800 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_802) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| 4)) v_ArrVal_806)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 18:17:35,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| Int) (v_ArrVal_802 Int) (v_ArrVal_800 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_800) .cse2 v_ArrVal_802)) |c_~#stored_elements~0.base| v_ArrVal_804))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_802) (< (+ (select .cse1 .cse3) 1) v_ArrVal_800) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| 4)) v_ArrVal_806)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 18:17:35,812 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| Int) (v_ArrVal_802 Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_798)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_800) .cse4 v_ArrVal_802)) |c_~#stored_elements~0.base| v_ArrVal_804))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| 4)) v_ArrVal_806)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_807) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_96| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_800) (< (+ (select .cse2 .cse4) 1) v_ArrVal_802)))))) is different from false [2022-11-25 18:17:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 18:17:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185395976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:40,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:40,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 18:17:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791242120] [2022-11-25 18:17:40,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:40,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 18:17:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:40,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 18:17:40,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=643, Unknown=15, NotChecked=354, Total=1190 [2022-11-25 18:17:40,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 18:17:40,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 286 transitions, 2881 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:17:40,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:17:40,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 18:17:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:18:05,287 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 162 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:18:07,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:18:09,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:18:11,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:18:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:16,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:17,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:20,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:21,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:24,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:25,488 INFO L130 PetriNetUnfolder]: 6727/13249 cut-off events. [2022-11-25 18:18:25,488 INFO L131 PetriNetUnfolder]: For 201156/201177 co-relation queries the response was YES. [2022-11-25 18:18:25,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85641 conditions, 13249 events. 6727/13249 cut-off events. For 201156/201177 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 108770 event pairs, 2424 based on Foata normal form. 19/11804 useless extension candidates. Maximal degree in co-relation 84685. Up to 5314 conditions per place. [2022-11-25 18:18:25,613 INFO L137 encePairwiseOnDemand]: 458/478 looper letters, 380 selfloop transitions, 207 changer transitions 0/592 dead transitions. [2022-11-25 18:18:25,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 592 transitions, 8827 flow [2022-11-25 18:18:25,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:18:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-25 18:18:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5579 transitions. [2022-11-25 18:18:25,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3890516039051604 [2022-11-25 18:18:25,621 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5579 transitions. [2022-11-25 18:18:25,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5579 transitions. [2022-11-25 18:18:25,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:18:25,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5579 transitions. [2022-11-25 18:18:25,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 185.96666666666667) internal successors, (5579), 30 states have internal predecessors, (5579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:25,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:25,650 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:25,650 INFO L175 Difference]: Start difference. First operand has 195 places, 286 transitions, 2881 flow. Second operand 30 states and 5579 transitions. [2022-11-25 18:18:25,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 592 transitions, 8827 flow [2022-11-25 18:18:26,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 592 transitions, 8120 flow, removed 304 selfloop flow, removed 7 redundant places. [2022-11-25 18:18:26,027 INFO L231 Difference]: Finished difference. Result has 229 places, 395 transitions, 4775 flow [2022-11-25 18:18:26,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4775, PETRI_PLACES=229, PETRI_TRANSITIONS=395} [2022-11-25 18:18:26,028 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 170 predicate places. [2022-11-25 18:18:26,028 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 395 transitions, 4775 flow [2022-11-25 18:18:26,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:26,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:18:26,029 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:26,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:26,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:18:26,236 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:18:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1045592111, now seen corresponding path program 1 times [2022-11-25 18:18:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:26,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28902365] [2022-11-25 18:18:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28902365] [2022-11-25 18:18:27,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28902365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83122473] [2022-11-25 18:18:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:27,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:27,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:27,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:18:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:27,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 18:18:27,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:27,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2022-11-25 18:18:27,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:27,644 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 28 treesize of output 28 [2022-11-25 18:18:27,772 INFO L321 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-11-25 18:18:27,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 36 [2022-11-25 18:18:27,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-11-25 18:18:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:27,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:28,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_888 (Array Int Int)) (v_ArrVal_889 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_889)) .cse1))))) is different from false [2022-11-25 18:18:28,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:28,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 52 [2022-11-25 18:18:28,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:28,171 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 75 treesize of output 75 [2022-11-25 18:18:28,179 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 40 treesize of output 28 [2022-11-25 18:18:28,194 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 18 treesize of output 10 [2022-11-25 18:18:28,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:28,236 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 64 treesize of output 52 [2022-11-25 18:18:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:28,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83122473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:18:28,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:18:28,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-25 18:18:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778799606] [2022-11-25 18:18:28,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:28,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:18:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:18:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=510, Unknown=2, NotChecked=46, Total=650 [2022-11-25 18:18:28,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 478 [2022-11-25 18:18:28,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 395 transitions, 4775 flow. Second operand has 26 states, 26 states have (on average 187.19230769230768) internal successors, (4867), 26 states have internal predecessors, (4867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:28,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:18:28,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 478 [2022-11-25 18:18:28,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:18:35,436 INFO L130 PetriNetUnfolder]: 8183/15940 cut-off events. [2022-11-25 18:18:35,436 INFO L131 PetriNetUnfolder]: For 500669/500684 co-relation queries the response was YES. [2022-11-25 18:18:35,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129679 conditions, 15940 events. 8183/15940 cut-off events. For 500669/500684 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 133891 event pairs, 2672 based on Foata normal form. 105/14294 useless extension candidates. Maximal degree in co-relation 127732. Up to 6948 conditions per place. [2022-11-25 18:18:35,626 INFO L137 encePairwiseOnDemand]: 465/478 looper letters, 495 selfloop transitions, 202 changer transitions 0/702 dead transitions. [2022-11-25 18:18:35,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 702 transitions, 11661 flow [2022-11-25 18:18:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:18:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 18:18:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3736 transitions. [2022-11-25 18:18:35,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4113631358731557 [2022-11-25 18:18:35,634 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3736 transitions. [2022-11-25 18:18:35,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3736 transitions. [2022-11-25 18:18:35,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:18:35,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3736 transitions. [2022-11-25 18:18:35,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 196.6315789473684) internal successors, (3736), 19 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:35,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:35,654 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:35,654 INFO L175 Difference]: Start difference. First operand has 229 places, 395 transitions, 4775 flow. Second operand 19 states and 3736 transitions. [2022-11-25 18:18:35,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 702 transitions, 11661 flow [2022-11-25 18:18:36,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 702 transitions, 9925 flow, removed 865 selfloop flow, removed 2 redundant places. [2022-11-25 18:18:36,425 INFO L231 Difference]: Finished difference. Result has 248 places, 447 transitions, 5320 flow [2022-11-25 18:18:36,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5320, PETRI_PLACES=248, PETRI_TRANSITIONS=447} [2022-11-25 18:18:36,426 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 189 predicate places. [2022-11-25 18:18:36,426 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 447 transitions, 5320 flow [2022-11-25 18:18:36,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 187.19230769230768) internal successors, (4867), 26 states have internal predecessors, (4867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:36,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:18:36,427 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:36,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:36,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:18:36,632 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:18:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 74035857, now seen corresponding path program 1 times [2022-11-25 18:18:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:36,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742632158] [2022-11-25 18:18:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742632158] [2022-11-25 18:18:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742632158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141938603] [2022-11-25 18:18:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:39,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:39,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:39,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:18:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:39,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-25 18:18:39,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:40,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:40,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:40,038 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:18:40,039 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:18:40,067 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:18:40,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:18:40,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:18:40,321 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 35 treesize of output 37 [2022-11-25 18:18:40,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 37 [2022-11-25 18:18:40,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 18:18:40,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:40,743 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 74 treesize of output 76 [2022-11-25 18:18:40,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 82 [2022-11-25 18:18:41,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 18:18:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:41,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:41,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_998 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_997) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_998)) .cse1)) 2147483647)) is different from false [2022-11-25 18:18:41,395 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_998 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_997) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_998)) .cse1)) 2147483647)) is different from false [2022-11-25 18:18:41,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_994 Int) (v_ArrVal_998 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_994) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_997) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_998)) .cse1)) 2147483647)) (= .cse4 20)))) is different from false [2022-11-25 18:18:41,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_994 Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_998 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_992))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_994) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_997) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_998)) .cse2)) 2147483647)))))) is different from false [2022-11-25 18:18:41,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_994 Int) (v_ArrVal_990 Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_998 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_992))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (or (= 20 .cse0) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_994) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_997) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_998)) .cse2)) 2147483647)))))) is different from false [2022-11-25 18:18:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 18:18:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141938603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:18:41,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:18:41,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-25 18:18:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063350501] [2022-11-25 18:18:41,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:41,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:18:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:18:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=580, Unknown=12, NotChecked=280, Total=1056 [2022-11-25 18:18:42,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 18:18:42,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 447 transitions, 5320 flow. Second operand has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:42,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:18:42,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 18:18:42,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:18:55,096 INFO L130 PetriNetUnfolder]: 9885/19348 cut-off events. [2022-11-25 18:18:55,097 INFO L131 PetriNetUnfolder]: For 609828/609853 co-relation queries the response was YES. [2022-11-25 18:18:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154127 conditions, 19348 events. 9885/19348 cut-off events. For 609828/609853 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 169591 event pairs, 4024 based on Foata normal form. 178/17389 useless extension candidates. Maximal degree in co-relation 152359. Up to 8988 conditions per place. [2022-11-25 18:18:55,313 INFO L137 encePairwiseOnDemand]: 458/478 looper letters, 513 selfloop transitions, 194 changer transitions 0/712 dead transitions. [2022-11-25 18:18:55,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 712 transitions, 11144 flow [2022-11-25 18:18:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:18:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-25 18:18:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3861 transitions. [2022-11-25 18:18:55,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4038702928870293 [2022-11-25 18:18:55,321 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3861 transitions. [2022-11-25 18:18:55,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3861 transitions. [2022-11-25 18:18:55,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:18:55,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3861 transitions. [2022-11-25 18:18:55,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 193.05) internal successors, (3861), 20 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:55,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:55,335 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:55,335 INFO L175 Difference]: Start difference. First operand has 248 places, 447 transitions, 5320 flow. Second operand 20 states and 3861 transitions. [2022-11-25 18:18:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 712 transitions, 11144 flow [2022-11-25 18:18:55,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 712 transitions, 11033 flow, removed 48 selfloop flow, removed 5 redundant places. [2022-11-25 18:18:55,915 INFO L231 Difference]: Finished difference. Result has 274 places, 517 transitions, 7081 flow [2022-11-25 18:18:55,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=5121, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7081, PETRI_PLACES=274, PETRI_TRANSITIONS=517} [2022-11-25 18:18:55,916 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 215 predicate places. [2022-11-25 18:18:55,916 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 517 transitions, 7081 flow [2022-11-25 18:18:55,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:55,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:18:55,918 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:55,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:56,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:56,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:18:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2115319579, now seen corresponding path program 1 times [2022-11-25 18:18:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:56,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444233911] [2022-11-25 18:18:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444233911] [2022-11-25 18:18:57,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444233911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417534285] [2022-11-25 18:18:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:57,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:57,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:57,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:57,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:18:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:57,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 18:18:57,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:57,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:57,348 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:18:57,349 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:18:57,380 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:18:57,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:18:57,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:18:57,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 37 [2022-11-25 18:18:57,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 18:18:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:58,014 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 74 treesize of output 76 [2022-11-25 18:18:58,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 92 treesize of output 85 [2022-11-25 18:18:58,327 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 81 treesize of output 83 [2022-11-25 18:18:58,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-25 18:18:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:58,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:58,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1106 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1105))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse0 .cse1))) (<= 0 (+ 2147483649 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1106)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1108) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-25 18:18:58,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1106 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1105))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (<= 0 (+ 2147483649 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1106)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1108) |c_~#queue~0.base|) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse1 .cse2))))))) is different from false [2022-11-25 18:18:59,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1101 Int) (v_ArrVal_1106 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1101) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1105))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (<= 0 (+ 2147483649 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1106)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1108) |c_~#queue~0.base|) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse1 .cse2))))))) is different from false [2022-11-25 18:18:59,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1101 Int) (v_ArrVal_1100 Int) (v_ArrVal_1106 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1100)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1101) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1105))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse0 .cse1))) (<= 0 (+ 2147483649 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1106)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1108) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-25 18:18:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:18:59,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417534285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:18:59,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:18:59,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-11-25 18:18:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714364872] [2022-11-25 18:18:59,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:59,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 18:18:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 18:18:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=497, Unknown=14, NotChecked=204, Total=870 [2022-11-25 18:18:59,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 478 [2022-11-25 18:18:59,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 517 transitions, 7081 flow. Second operand has 30 states, 30 states have (on average 182.96666666666667) internal successors, (5489), 30 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:18:59,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:18:59,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 478 [2022-11-25 18:18:59,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:08,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:19:13,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:19:16,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:19:24,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:19:31,946 INFO L130 PetriNetUnfolder]: 12826/25141 cut-off events. [2022-11-25 18:19:31,947 INFO L131 PetriNetUnfolder]: For 979934/980165 co-relation queries the response was YES. [2022-11-25 18:19:32,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223755 conditions, 25141 events. 12826/25141 cut-off events. For 979934/980165 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 220803 event pairs, 3751 based on Foata normal form. 366/22655 useless extension candidates. Maximal degree in co-relation 220610. Up to 9858 conditions per place. [2022-11-25 18:19:32,443 INFO L137 encePairwiseOnDemand]: 456/478 looper letters, 438 selfloop transitions, 465 changer transitions 0/908 dead transitions. [2022-11-25 18:19:32,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 908 transitions, 16958 flow [2022-11-25 18:19:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:19:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-11-25 18:19:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6327 transitions. [2022-11-25 18:19:32,454 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.401103081019399 [2022-11-25 18:19:32,454 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6327 transitions. [2022-11-25 18:19:32,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6327 transitions. [2022-11-25 18:19:32,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:32,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6327 transitions. [2022-11-25 18:19:32,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 191.72727272727272) internal successors, (6327), 33 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:32,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 478.0) internal successors, (16252), 34 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:32,483 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 478.0) internal successors, (16252), 34 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:32,483 INFO L175 Difference]: Start difference. First operand has 274 places, 517 transitions, 7081 flow. Second operand 33 states and 6327 transitions. [2022-11-25 18:19:32,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 908 transitions, 16958 flow [2022-11-25 18:19:34,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 908 transitions, 16099 flow, removed 333 selfloop flow, removed 8 redundant places. [2022-11-25 18:19:34,054 INFO L231 Difference]: Finished difference. Result has 310 places, 680 transitions, 11285 flow [2022-11-25 18:19:34,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=6199, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=11285, PETRI_PLACES=310, PETRI_TRANSITIONS=680} [2022-11-25 18:19:34,055 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 251 predicate places. [2022-11-25 18:19:34,056 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 680 transitions, 11285 flow [2022-11-25 18:19:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 182.96666666666667) internal successors, (5489), 30 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:34,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:34,057 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:34,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:19:34,257 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:19:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876182, now seen corresponding path program 1 times [2022-11-25 18:19:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811443639] [2022-11-25 18:19:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:34,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811443639] [2022-11-25 18:19:34,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811443639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:34,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579669932] [2022-11-25 18:19:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:34,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:34,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:19:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:34,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:19:34,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:34,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:19:34,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579669932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:34,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:19:34,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-11-25 18:19:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937925276] [2022-11-25 18:19:34,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:34,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:19:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:19:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:19:34,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 18:19:34,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 680 transitions, 11285 flow. Second operand has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:34,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:34,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 18:19:34,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:44,700 INFO L130 PetriNetUnfolder]: 12826/25133 cut-off events. [2022-11-25 18:19:44,701 INFO L131 PetriNetUnfolder]: For 1859097/1859139 co-relation queries the response was YES. [2022-11-25 18:19:44,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280318 conditions, 25133 events. 12826/25133 cut-off events. For 1859097/1859139 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 220876 event pairs, 5932 based on Foata normal form. 0/22289 useless extension candidates. Maximal degree in co-relation 276436. Up to 22263 conditions per place. [2022-11-25 18:19:45,325 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 657 selfloop transitions, 34 changer transitions 0/695 dead transitions. [2022-11-25 18:19:45,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 695 transitions, 13291 flow [2022-11-25 18:19:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:19:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:19:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 990 transitions. [2022-11-25 18:19:45,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5177824267782427 [2022-11-25 18:19:45,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 990 transitions. [2022-11-25 18:19:45,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 990 transitions. [2022-11-25 18:19:45,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:45,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 990 transitions. [2022-11-25 18:19:45,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:45,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:45,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:45,332 INFO L175 Difference]: Start difference. First operand has 310 places, 680 transitions, 11285 flow. Second operand 4 states and 990 transitions. [2022-11-25 18:19:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 695 transitions, 13291 flow [2022-11-25 18:19:49,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 695 transitions, 11328 flow, removed 836 selfloop flow, removed 10 redundant places. [2022-11-25 18:19:49,188 INFO L231 Difference]: Finished difference. Result has 302 places, 679 transitions, 9388 flow [2022-11-25 18:19:49,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=9320, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9388, PETRI_PLACES=302, PETRI_TRANSITIONS=679} [2022-11-25 18:19:49,189 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 243 predicate places. [2022-11-25 18:19:49,189 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 679 transitions, 9388 flow [2022-11-25 18:19:49,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:49,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:49,190 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:49,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:49,390 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:19:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876005, now seen corresponding path program 1 times [2022-11-25 18:19:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:49,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628085203] [2022-11-25 18:19:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:19:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628085203] [2022-11-25 18:19:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628085203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:49,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:49,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488552902] [2022-11-25 18:19:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:49,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:19:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:19:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:19:49,488 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 18:19:49,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 679 transitions, 9388 flow. Second operand has 4 states, 4 states have (on average 236.5) internal successors, (946), 4 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:49,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:49,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 18:19:49,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:58,642 INFO L130 PetriNetUnfolder]: 12575/24736 cut-off events. [2022-11-25 18:19:58,642 INFO L131 PetriNetUnfolder]: For 1738516/1738518 co-relation queries the response was YES. [2022-11-25 18:19:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259752 conditions, 24736 events. 12575/24736 cut-off events. For 1738516/1738518 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 218173 event pairs, 6340 based on Foata normal form. 205/22352 useless extension candidates. Maximal degree in co-relation 255891. Up to 14163 conditions per place. [2022-11-25 18:19:59,346 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 614 selfloop transitions, 78 changer transitions 0/696 dead transitions. [2022-11-25 18:19:59,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 696 transitions, 11418 flow [2022-11-25 18:19:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:19:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:19:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 986 transitions. [2022-11-25 18:19:59,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5156903765690377 [2022-11-25 18:19:59,349 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 986 transitions. [2022-11-25 18:19:59,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 986 transitions. [2022-11-25 18:19:59,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:59,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 986 transitions. [2022-11-25 18:19:59,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.5) internal successors, (986), 4 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:59,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:59,352 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:59,352 INFO L175 Difference]: Start difference. First operand has 302 places, 679 transitions, 9388 flow. Second operand 4 states and 986 transitions. [2022-11-25 18:19:59,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 696 transitions, 11418 flow [2022-11-25 18:20:01,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 696 transitions, 11279 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-11-25 18:20:01,190 INFO L231 Difference]: Finished difference. Result has 298 places, 678 transitions, 9402 flow [2022-11-25 18:20:01,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=9246, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9402, PETRI_PLACES=298, PETRI_TRANSITIONS=678} [2022-11-25 18:20:01,191 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 239 predicate places. [2022-11-25 18:20:01,191 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 678 transitions, 9402 flow [2022-11-25 18:20:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.5) internal successors, (946), 4 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:01,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:01,192 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-11-25 18:20:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:20:01,192 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:20:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -822517710, now seen corresponding path program 1 times [2022-11-25 18:20:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:01,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063159748] [2022-11-25 18:20:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:01,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:01,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063159748] [2022-11-25 18:20:01,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063159748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:01,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379194526] [2022-11-25 18:20:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:01,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:20:01,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:20:01,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:20:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:01,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:20:01,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:01,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:20:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:01,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379194526] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:20:01,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:20:01,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 18:20:01,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454223198] [2022-11-25 18:20:01,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:20:01,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:20:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:01,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:20:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:20:01,608 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 18:20:01,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 678 transitions, 9402 flow. Second operand has 10 states, 10 states have (on average 235.6) internal successors, (2356), 10 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:01,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:01,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 18:20:01,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:07,818 INFO L130 PetriNetUnfolder]: 8257/15878 cut-off events. [2022-11-25 18:20:07,818 INFO L131 PetriNetUnfolder]: For 1230969/1230969 co-relation queries the response was YES. [2022-11-25 18:20:07,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193236 conditions, 15878 events. 8257/15878 cut-off events. For 1230969/1230969 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 119859 event pairs, 2658 based on Foata normal form. 329/14594 useless extension candidates. Maximal degree in co-relation 190357. Up to 5854 conditions per place. [2022-11-25 18:20:08,045 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 642 selfloop transitions, 45 changer transitions 0/691 dead transitions. [2022-11-25 18:20:08,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 691 transitions, 11883 flow [2022-11-25 18:20:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1716 transitions. [2022-11-25 18:20:08,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5128511655708309 [2022-11-25 18:20:08,050 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1716 transitions. [2022-11-25 18:20:08,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1716 transitions. [2022-11-25 18:20:08,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:08,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1716 transitions. [2022-11-25 18:20:08,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 245.14285714285714) internal successors, (1716), 7 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:08,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:08,058 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:08,058 INFO L175 Difference]: Start difference. First operand has 298 places, 678 transitions, 9402 flow. Second operand 7 states and 1716 transitions. [2022-11-25 18:20:08,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 691 transitions, 11883 flow [2022-11-25 18:20:09,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 691 transitions, 11723 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-11-25 18:20:09,614 INFO L231 Difference]: Finished difference. Result has 303 places, 653 transitions, 9027 flow [2022-11-25 18:20:09,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=8696, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9027, PETRI_PLACES=303, PETRI_TRANSITIONS=653} [2022-11-25 18:20:09,615 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 244 predicate places. [2022-11-25 18:20:09,615 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 653 transitions, 9027 flow [2022-11-25 18:20:09,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.6) internal successors, (2356), 10 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:09,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:09,616 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:09,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:20:09,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:09,817 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 18:20:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 642062618, now seen corresponding path program 4 times [2022-11-25 18:20:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:09,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388875275] [2022-11-25 18:20:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:13,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388875275] [2022-11-25 18:20:13,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388875275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:13,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133143716] [2022-11-25 18:20:13,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:20:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:20:13,395 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:20:13,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28f1ac5a-79b8-4ed0-a3bc-95d332d06d2b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:20:13,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:20:13,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:20:13,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 18:20:13,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:13,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,681 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:20:13,682 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 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 18:20:13,717 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:20:13,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:20:13,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-25 18:20:14,058 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 35 treesize of output 37 [2022-11-25 18:20:14,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 46 [2022-11-25 18:20:14,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:20:14,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:14,702 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 45 treesize of output 47 [2022-11-25 18:20:14,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 56 [2022-11-25 18:20:15,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 63 [2022-11-25 18:20:16,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-25 18:20:16,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:16,722 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 62 treesize of output 64 [2022-11-25 18:20:21,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 73 [2022-11-25 18:20:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:27,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:20:28,025 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:20:28,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1438 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-25 18:20:28,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1435)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1437) .cse4 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse4))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ .cse1 1) v_ArrVal_1438) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1437) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= .cse1 20))))) is different from false [2022-11-25 18:20:37,812 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1431 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1437) .cse4 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse4))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse1) 2147483647) (< (+ .cse2 1) v_ArrVal_1438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse3 .cse4))) (not (<= v_ArrVal_1431 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1437) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 .cse4))) (= .cse2 20))))))) is different from false [2022-11-25 18:20:37,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1431 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1437) .cse6 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1431) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse3) 2147483647) (< (+ .cse4 1) v_ArrVal_1438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse5 .cse6))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1437) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 .cse6))) (= .cse4 20)))))))) is different from false [2022-11-25 18:20:38,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1429 Int) (v_ArrVal_1431 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1429) .cse2 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse3 .cse6)) (.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1437) .cse6 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1431) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1437) (< (+ .cse0 1) v_ArrVal_1438) (not (<= v_ArrVal_1429 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse5 .cse6))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse7 .cse6)))))))))) is different from false [2022-11-25 18:20:38,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1429 Int) (v_ArrVal_1431 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse5 v_ArrVal_1429) .cse2 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse3 .cse7)) (.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1437) .cse7 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1431) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1437) (< (+ (select .cse1 .cse5) 1) v_ArrVal_1429) (< (+ .cse0 1) v_ArrVal_1438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse6 .cse7))) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse8 .cse7)))))))))) is different from false [2022-11-25 18:20:38,282 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1431 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1428))) (let ((.cse0 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1429) .cse2 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1437) .cse7 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse8 (select .cse3 .cse7))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1429) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1431) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1437) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse5 .cse7))) (< (+ .cse8 1) v_ArrVal_1438) (= 20 .cse8))))))))) is different from false [2022-11-25 18:20:38,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1435 Int) (v_ArrVal_1426 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1426)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1428))) (let ((.cse0 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse7 v_ArrVal_1429) .cse1 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1437) .cse3 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1431) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse4) 2147483647) (= .cse5 20) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1437) (< (+ .cse5 1) v_ArrVal_1438) (< (+ (select .cse0 .cse7) 1) v_ArrVal_1429) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse8 .cse3))))))))))) is different from false [2022-11-25 18:20:38,465 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1435 Int) (v_ArrVal_1426 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1426)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1428))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1429) .cse3 v_ArrVal_1431)) |c_~#stored_elements~0.base| v_ArrVal_1433))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1435))) (let ((.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1437) .cse3 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|)) (.cse0 (select .cse6 .cse3))) (or (= .cse0 20) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse1 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1431) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse5 .cse3))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1437) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1429) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse7 .cse3))) (< (+ .cse0 1) v_ArrVal_1438)))))))))) is different from false [2022-11-25 18:20:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-25 18:20:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133143716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:20:38,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:20:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2022-11-25 18:20:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879937389] [2022-11-25 18:20:38,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:20:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-25 18:20:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-25 18:20:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1593, Unknown=37, NotChecked=970, Total=3080 [2022-11-25 18:20:38,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 18:20:38,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 653 transitions, 9027 flow. Second operand has 56 states, 56 states have (on average 177.39285714285714) internal successors, (9934), 56 states have internal predecessors, (9934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:38,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:38,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 18:20:38,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:46,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:55,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:59,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:01,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:03,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:16,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:23,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:31,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:33,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:39,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:46,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:50,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:52,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:55,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:57,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:59,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:29,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:41,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:43,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:48,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:22:50,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:22:50,172 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse4 .cse5))) (let ((.cse2 (+ .cse7 1)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse1) 2147483647) (< .cse2 v_ArrVal_1438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 .cse3)))))) (or (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1437) .cse5 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1437 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse2 v_ArrVal_1438) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse6 .cse3)))))) (= .cse7 20)))))) is different from false [2022-11-25 18:22:52,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:53,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:56,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:22:56,997 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 .cse4)))))) (forall ((v_ArrVal_1442 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1438)) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1438 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1442) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse5 .cse4)))))))) is different from false