./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8 --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 22:08:39,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:08:39,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:08:39,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:08:39,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:08:39,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:08:39,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:08:39,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:08:39,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:08:39,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:08:39,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:08:39,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:08:39,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:08:39,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:08:39,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:08:39,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:08:39,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:08:39,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:08:39,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:08:39,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:08:39,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:08:39,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:08:39,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:08:39,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:08:39,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:08:39,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:08:39,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:08:39,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:08:39,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:08:39,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:08:39,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:08:39,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:08:39,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:08:39,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:08:39,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:08:39,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:08:39,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:08:39,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:08:39,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:08:39,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:08:39,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:08:39,996 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 22:08:40,010 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:08:40,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:08:40,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:08:40,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:08:40,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:08:40,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:08:40,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:08:40,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:08:40,012 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:08:40,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:08:40,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:08:40,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:08:40,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:08:40,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:08:40,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:08:40,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:08:40,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:08:40,016 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:08:40,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:08:40,016 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:08:40,016 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_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-12-13 22:08:40,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:08:40,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:08:40,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:08:40,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:08:40,224 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:08:40,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-13 22:08:42,709 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:08:42,907 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:08:42,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-13 22:08:42,917 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/data/9b8da76e8/8a6a637560854aa295fe14c1b1acf26c/FLAG773edf88e [2022-12-13 22:08:43,285 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/data/9b8da76e8/8a6a637560854aa295fe14c1b1acf26c [2022-12-13 22:08:43,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:08:43,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:08:43,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:08:43,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:08:43,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:08:43,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d729e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43, skipping insertion in model container [2022-12-13 22:08:43,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:08:43,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:08:43,600 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_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-13 22:08:43,602 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_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-13 22:08:43,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:08:43,614 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:08:43,646 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_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-13 22:08:43,648 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_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-13 22:08:43,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:08:43,681 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:08:43,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43 WrapperNode [2022-12-13 22:08:43,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:08:43,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:08:43,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:08:43,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:08:43,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,719 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-13 22:08:43,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:08:43,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:08:43,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:08:43,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:08:43,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,740 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:08:43,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:08:43,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:08:43,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:08:43,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (1/1) ... [2022-12-13 22:08:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:08:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:08:43,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:08:43,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:08:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 22:08:43,800 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 22:08:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 22:08:43,801 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:08:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:08:43,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:08:43,802 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:08:43,920 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:08:43,922 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:08:44,195 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:08:44,204 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:08:44,204 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 22:08:44,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:08:44 BoogieIcfgContainer [2022-12-13 22:08:44,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:08:44,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:08:44,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:08:44,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:08:44,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:08:43" (1/3) ... [2022-12-13 22:08:44,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acfbc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:08:44, skipping insertion in model container [2022-12-13 22:08:44,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:43" (2/3) ... [2022-12-13 22:08:44,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acfbc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:08:44, skipping insertion in model container [2022-12-13 22:08:44,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:08:44" (3/3) ... [2022-12-13 22:08:44,215 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-13 22:08:44,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:08:44,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:08:44,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 22:08:44,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:08:44,316 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 22:08:44,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 22:08:44,431 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-13 22:08:44,431 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 22:08:44,439 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 462 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-12-13 22:08:44,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 22:08:44,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-12-13 22:08:44,446 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:08:44,453 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 22:08:44,455 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 22:08:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-12-13 22:08:44,487 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-12-13 22:08:44,488 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 22:08:44,489 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 377 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-12-13 22:08:44,493 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-13 22:08:51,741 INFO L134 LiptonReduction]: Checked pairs total: 29129 [2022-12-13 22:08:51,742 INFO L136 LiptonReduction]: Total number of compositions: 226 [2022-12-13 22:08:51,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:08:51,755 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;@1d364bb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:08:51,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-13 22:08:51,759 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-13 22:08:51,759 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 22:08:51,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:51,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:51,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash 336045671, now seen corresponding path program 1 times [2022-12-13 22:08:51,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:51,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232844459] [2022-12-13 22:08:51,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232844459] [2022-12-13 22:08:52,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232844459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:52,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:52,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720189048] [2022-12-13 22:08:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:52,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:08:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:08:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:08:53,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 22:08:53,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 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-12-13 22:08:53,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:53,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 22:08:53,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:08:53,706 INFO L130 PetriNetUnfolder]: 1558/2568 cut-off events. [2022-12-13 22:08:53,706 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-13 22:08:53,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 2568 events. 1558/2568 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12807 event pairs, 1122 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 4932. Up to 2503 conditions per place. [2022-12-13 22:08:53,721 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 57 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-13 22:08:53,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 275 flow [2022-12-13 22:08:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:08:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:08:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-13 22:08:53,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49937106918238994 [2022-12-13 22:08:53,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1191 transitions. [2022-12-13 22:08:53,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1191 transitions. [2022-12-13 22:08:53,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:08:53,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1191 transitions. [2022-12-13 22:08:53,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.2) internal successors, (1191), 5 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:53,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:53,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:53,762 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 5 states and 1191 transitions. [2022-12-13 22:08:53,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 275 flow [2022-12-13 22:08:53,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:08:53,768 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 165 flow [2022-12-13 22:08:53,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2022-12-13 22:08:53,774 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2022-12-13 22:08:53,774 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 165 flow [2022-12-13 22:08:53,775 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-12-13 22:08:53,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:53,775 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:53,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:08:53,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1827228268, now seen corresponding path program 1 times [2022-12-13 22:08:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:53,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565871854] [2022-12-13 22:08:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565871854] [2022-12-13 22:08:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565871854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:54,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:54,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:08:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797814758] [2022-12-13 22:08:54,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:54,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:08:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:08:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:08:55,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 22:08:55,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:55,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:55,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 22:08:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:08:56,116 INFO L130 PetriNetUnfolder]: 2031/3408 cut-off events. [2022-12-13 22:08:56,117 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 22:08:56,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 3408 events. 2031/3408 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18764 event pairs, 417 based on Foata normal form. 31/2595 useless extension candidates. Maximal degree in co-relation 6048. Up to 2497 conditions per place. [2022-12-13 22:08:56,127 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 111 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2022-12-13 22:08:56,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 129 transitions, 560 flow [2022-12-13 22:08:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:08:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:08:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2022-12-13 22:08:56,130 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5169811320754717 [2022-12-13 22:08:56,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1233 transitions. [2022-12-13 22:08:56,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1233 transitions. [2022-12-13 22:08:56,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:08:56,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1233 transitions. [2022-12-13 22:08:56,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.6) internal successors, (1233), 5 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:56,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:56,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:56,136 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 165 flow. Second operand 5 states and 1233 transitions. [2022-12-13 22:08:56,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 129 transitions, 560 flow [2022-12-13 22:08:56,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:08:56,141 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 237 flow [2022-12-13 22:08:56,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2022-12-13 22:08:56,142 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2022-12-13 22:08:56,142 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 237 flow [2022-12-13 22:08:56,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:56,143 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:56,143 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:08:56,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1827483088, now seen corresponding path program 2 times [2022-12-13 22:08:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046641630] [2022-12-13 22:08:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046641630] [2022-12-13 22:08:56,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046641630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:08:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496001717] [2022-12-13 22:08:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:08:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:08:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:08:56,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 22:08:56,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:56,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:56,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 22:08:56,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:08:57,044 INFO L130 PetriNetUnfolder]: 2131/3578 cut-off events. [2022-12-13 22:08:57,044 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-13 22:08:57,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8087 conditions, 3578 events. 2131/3578 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19785 event pairs, 476 based on Foata normal form. 31/2741 useless extension candidates. Maximal degree in co-relation 7239. Up to 2499 conditions per place. [2022-12-13 22:08:57,056 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 113 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2022-12-13 22:08:57,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 132 transitions, 631 flow [2022-12-13 22:08:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:08:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:08:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1232 transitions. [2022-12-13 22:08:57,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5165618448637317 [2022-12-13 22:08:57,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1232 transitions. [2022-12-13 22:08:57,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1232 transitions. [2022-12-13 22:08:57,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:08:57,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1232 transitions. [2022-12-13 22:08:57,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.4) internal successors, (1232), 5 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,065 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 237 flow. Second operand 5 states and 1232 transitions. [2022-12-13 22:08:57,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 132 transitions, 631 flow [2022-12-13 22:08:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 617 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 22:08:57,071 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 282 flow [2022-12-13 22:08:57,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2022-12-13 22:08:57,072 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2022-12-13 22:08:57,072 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 282 flow [2022-12-13 22:08:57,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:57,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:08:57,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1139052889, now seen corresponding path program 1 times [2022-12-13 22:08:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525552015] [2022-12-13 22:08:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525552015] [2022-12-13 22:08:57,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525552015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086613386] [2022-12-13 22:08:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:08:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:08:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:08:57,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 477 [2022-12-13 22:08:57,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 282 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-12-13 22:08:57,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:57,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 477 [2022-12-13 22:08:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:08:57,694 INFO L130 PetriNetUnfolder]: 3672/5999 cut-off events. [2022-12-13 22:08:57,695 INFO L131 PetriNetUnfolder]: For 2407/2407 co-relation queries the response was YES. [2022-12-13 22:08:57,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13897 conditions, 5999 events. 3672/5999 cut-off events. For 2407/2407 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 35460 event pairs, 1819 based on Foata normal form. 0/4499 useless extension candidates. Maximal degree in co-relation 12559. Up to 3645 conditions per place. [2022-12-13 22:08:57,718 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 146 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2022-12-13 22:08:57,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 154 transitions, 875 flow [2022-12-13 22:08:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:08:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:08:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1050 transitions. [2022-12-13 22:08:57,722 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.550314465408805 [2022-12-13 22:08:57,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1050 transitions. [2022-12-13 22:08:57,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1050 transitions. [2022-12-13 22:08:57,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:08:57,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1050 transitions. [2022-12-13 22:08:57,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 262.5) internal successors, (1050), 4 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,730 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,730 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 282 flow. Second operand 4 states and 1050 transitions. [2022-12-13 22:08:57,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 154 transitions, 875 flow [2022-12-13 22:08:57,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 839 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 22:08:57,738 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 299 flow [2022-12-13 22:08:57,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2022-12-13 22:08:57,739 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2022-12-13 22:08:57,739 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 299 flow [2022-12-13 22:08:57,740 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-12-13 22:08:57,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:57,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:08:57,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -435859728, now seen corresponding path program 1 times [2022-12-13 22:08:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571791164] [2022-12-13 22:08:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571791164] [2022-12-13 22:08:57,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571791164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428835651] [2022-12-13 22:08:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:08:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:08:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:08:58,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 477 [2022-12-13 22:08:58,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:58,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:58,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 477 [2022-12-13 22:08:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:08:58,606 INFO L130 PetriNetUnfolder]: 3608/6029 cut-off events. [2022-12-13 22:08:58,606 INFO L131 PetriNetUnfolder]: For 2505/2515 co-relation queries the response was YES. [2022-12-13 22:08:58,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 6029 events. 3608/6029 cut-off events. For 2505/2515 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 36557 event pairs, 2341 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 9510. Up to 5652 conditions per place. [2022-12-13 22:08:58,624 INFO L137 encePairwiseOnDemand]: 466/477 looper letters, 99 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2022-12-13 22:08:58,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 633 flow [2022-12-13 22:08:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:08:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:08:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2022-12-13 22:08:58,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5014675052410902 [2022-12-13 22:08:58,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1196 transitions. [2022-12-13 22:08:58,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1196 transitions. [2022-12-13 22:08:58,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:08:58,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1196 transitions. [2022-12-13 22:08:58,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:58,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:58,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:58,630 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 299 flow. Second operand 5 states and 1196 transitions. [2022-12-13 22:08:58,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 633 flow [2022-12-13 22:08:58,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:08:58,636 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 373 flow [2022-12-13 22:08:58,636 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2022-12-13 22:08:58,637 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-13 22:08:58,637 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 373 flow [2022-12-13 22:08:58,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:58,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:08:58,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:08:58,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:08:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash -435859775, now seen corresponding path program 1 times [2022-12-13 22:08:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685677882] [2022-12-13 22:08:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:59,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685677882] [2022-12-13 22:08:59,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685677882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:59,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:59,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160852210] [2022-12-13 22:08:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:59,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:08:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:08:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:08:59,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 22:08:59,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:59,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:08:59,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 22:08:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:00,276 INFO L130 PetriNetUnfolder]: 3607/6028 cut-off events. [2022-12-13 22:09:00,276 INFO L131 PetriNetUnfolder]: For 2974/2984 co-relation queries the response was YES. [2022-12-13 22:09:00,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14891 conditions, 6028 events. 3607/6028 cut-off events. For 2974/2984 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 36164 event pairs, 2542 based on Foata normal form. 1/5085 useless extension candidates. Maximal degree in co-relation 10165. Up to 5841 conditions per place. [2022-12-13 22:09:00,295 INFO L137 encePairwiseOnDemand]: 471/477 looper letters, 77 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2022-12-13 22:09:00,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 90 transitions, 563 flow [2022-12-13 22:09:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:09:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:09:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1193 transitions. [2022-12-13 22:09:00,299 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5002096436058701 [2022-12-13 22:09:00,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1193 transitions. [2022-12-13 22:09:00,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1193 transitions. [2022-12-13 22:09:00,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:00,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1193 transitions. [2022-12-13 22:09:00,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.6) internal successors, (1193), 5 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:00,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:00,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:00,306 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 373 flow. Second operand 5 states and 1193 transitions. [2022-12-13 22:09:00,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 90 transitions, 563 flow [2022-12-13 22:09:00,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 546 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:09:00,317 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 382 flow [2022-12-13 22:09:00,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2022-12-13 22:09:00,318 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2022-12-13 22:09:00,318 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 382 flow [2022-12-13 22:09:00,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:00,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:00,319 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:09:00,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 538174762, now seen corresponding path program 1 times [2022-12-13 22:09:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:00,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100403058] [2022-12-13 22:09:00,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:00,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:00,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100403058] [2022-12-13 22:09:00,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100403058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:00,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:00,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:09:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931183206] [2022-12-13 22:09:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:00,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:09:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:09:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:09:01,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 22:09:01,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:01,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:01,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 22:09:01,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:02,816 INFO L130 PetriNetUnfolder]: 3836/6391 cut-off events. [2022-12-13 22:09:02,816 INFO L131 PetriNetUnfolder]: For 2405/2435 co-relation queries the response was YES. [2022-12-13 22:09:02,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15703 conditions, 6391 events. 3836/6391 cut-off events. For 2405/2435 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 39283 event pairs, 699 based on Foata normal form. 147/5567 useless extension candidates. Maximal degree in co-relation 15279. Up to 4628 conditions per place. [2022-12-13 22:09:02,835 INFO L137 encePairwiseOnDemand]: 468/477 looper letters, 130 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2022-12-13 22:09:02,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 151 transitions, 875 flow [2022-12-13 22:09:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:09:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:09:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-12-13 22:09:02,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5186582809224318 [2022-12-13 22:09:02,837 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-12-13 22:09:02,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-12-13 22:09:02,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:02,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-12-13 22:09:02,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.4) internal successors, (1237), 5 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:02,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:02,841 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:02,842 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 382 flow. Second operand 5 states and 1237 transitions. [2022-12-13 22:09:02,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 151 transitions, 875 flow [2022-12-13 22:09:02,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 151 transitions, 863 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:09:02,858 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 432 flow [2022-12-13 22:09:02,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-12-13 22:09:02,858 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2022-12-13 22:09:02,858 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 432 flow [2022-12-13 22:09:02,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:02,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:02,859 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:02,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:09:02,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -624863530, now seen corresponding path program 2 times [2022-12-13 22:09:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:02,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010469013] [2022-12-13 22:09:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:03,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010469013] [2022-12-13 22:09:03,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010469013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:03,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:03,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:09:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585919234] [2022-12-13 22:09:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:03,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:09:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:09:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:09:03,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 477 [2022-12-13 22:09:03,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 432 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-12-13 22:09:03,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:03,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 477 [2022-12-13 22:09:03,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:04,567 INFO L130 PetriNetUnfolder]: 4086/6815 cut-off events. [2022-12-13 22:09:04,568 INFO L131 PetriNetUnfolder]: For 4799/4819 co-relation queries the response was YES. [2022-12-13 22:09:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17436 conditions, 6815 events. 4086/6815 cut-off events. For 4799/4819 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 41038 event pairs, 1079 based on Foata normal form. 147/5960 useless extension candidates. Maximal degree in co-relation 15479. Up to 4391 conditions per place. [2022-12-13 22:09:04,588 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 132 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2022-12-13 22:09:04,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 933 flow [2022-12-13 22:09:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:09:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:09:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1241 transitions. [2022-12-13 22:09:04,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5203354297693921 [2022-12-13 22:09:04,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1241 transitions. [2022-12-13 22:09:04,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1241 transitions. [2022-12-13 22:09:04,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:04,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1241 transitions. [2022-12-13 22:09:04,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 248.2) internal successors, (1241), 5 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,595 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,595 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 432 flow. Second operand 5 states and 1241 transitions. [2022-12-13 22:09:04,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 933 flow [2022-12-13 22:09:04,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 909 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:09:04,608 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 476 flow [2022-12-13 22:09:04,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2022-12-13 22:09:04,609 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-13 22:09:04,609 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 476 flow [2022-12-13 22:09:04,609 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-12-13 22:09:04,609 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:04,609 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:04,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:09:04,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -586638581, now seen corresponding path program 1 times [2022-12-13 22:09:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:04,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829747214] [2022-12-13 22:09:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:04,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829747214] [2022-12-13 22:09:04,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829747214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:04,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:04,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:09:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394479214] [2022-12-13 22:09:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:09:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:09:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:09:04,647 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 22:09:04,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 476 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-12-13 22:09:04,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:04,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 22:09:04,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:04,830 INFO L130 PetriNetUnfolder]: 861/1658 cut-off events. [2022-12-13 22:09:04,830 INFO L131 PetriNetUnfolder]: For 1088/1088 co-relation queries the response was YES. [2022-12-13 22:09:04,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 1658 events. 861/1658 cut-off events. For 1088/1088 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9176 event pairs, 583 based on Foata normal form. 72/1588 useless extension candidates. Maximal degree in co-relation 3634. Up to 809 conditions per place. [2022-12-13 22:09:04,834 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 74 selfloop transitions, 2 changer transitions 8/87 dead transitions. [2022-12-13 22:09:04,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 592 flow [2022-12-13 22:09:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:09:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:09:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-12-13 22:09:04,836 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5366876310272537 [2022-12-13 22:09:04,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-12-13 22:09:04,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-12-13 22:09:04,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:04,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-12-13 22:09:04,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,839 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 476 flow. Second operand 3 states and 768 transitions. [2022-12-13 22:09:04,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 592 flow [2022-12-13 22:09:04,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 558 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 22:09:04,843 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 361 flow [2022-12-13 22:09:04,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=361, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-12-13 22:09:04,843 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-13 22:09:04,843 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 361 flow [2022-12-13 22:09:04,844 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-12-13 22:09:04,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:04,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:04,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:09:04,844 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2045579967, now seen corresponding path program 1 times [2022-12-13 22:09:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:04,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139190107] [2022-12-13 22:09:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:04,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139190107] [2022-12-13 22:09:04,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139190107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:04,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:04,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:09:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715553335] [2022-12-13 22:09:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:04,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:09:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:09:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:09:04,878 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 22:09:04,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:04,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:04,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 22:09:04,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:05,037 INFO L130 PetriNetUnfolder]: 637/1217 cut-off events. [2022-12-13 22:09:05,038 INFO L131 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2022-12-13 22:09:05,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 1217 events. 637/1217 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5782 event pairs, 460 based on Foata normal form. 10/1131 useless extension candidates. Maximal degree in co-relation 2546. Up to 882 conditions per place. [2022-12-13 22:09:05,041 INFO L137 encePairwiseOnDemand]: 472/477 looper letters, 78 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2022-12-13 22:09:05,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 547 flow [2022-12-13 22:09:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:09:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:09:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2022-12-13 22:09:05,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5415793151642209 [2022-12-13 22:09:05,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2022-12-13 22:09:05,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2022-12-13 22:09:05,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:05,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2022-12-13 22:09:05,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:05,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:05,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:05,046 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 361 flow. Second operand 3 states and 775 transitions. [2022-12-13 22:09:05,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 547 flow [2022-12-13 22:09:05,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 541 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 22:09:05,048 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 365 flow [2022-12-13 22:09:05,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-12-13 22:09:05,049 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-13 22:09:05,049 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 365 flow [2022-12-13 22:09:05,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:05,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:05,049 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:05,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:09:05,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516148, now seen corresponding path program 1 times [2022-12-13 22:09:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:05,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818023] [2022-12-13 22:09:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:05,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:05,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818023] [2022-12-13 22:09:05,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:09:05,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174415430] [2022-12-13 22:09:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:09:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:05,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:09:05,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 22:09:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:05,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 22:09:05,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:09:05,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 22:09:05,587 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-12-13 22:09:05,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:05,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 22:09:05,685 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 22:09:05,685 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-12-13 22:09:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:05,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:09:05,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:09:05,938 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-13 22:09:05,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:09:05,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-12-13 22:09:05,956 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 32 treesize of output 28 [2022-12-13 22:09:05,975 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 9 treesize of output 5 [2022-12-13 22:09:05,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:09:05,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-12-13 22:09:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:06,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174415430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:09:06,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:09:06,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 22:09:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757161890] [2022-12-13 22:09:06,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:09:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 22:09:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 22:09:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=393, Unknown=3, NotChecked=0, Total=506 [2022-12-13 22:09:07,137 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 477 [2022-12-13 22:09:07,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 365 flow. Second operand has 23 states, 23 states have (on average 192.95652173913044) internal successors, (4438), 23 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:07,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:07,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 477 [2022-12-13 22:09:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:07,778 INFO L130 PetriNetUnfolder]: 1284/2478 cut-off events. [2022-12-13 22:09:07,778 INFO L131 PetriNetUnfolder]: For 956/956 co-relation queries the response was YES. [2022-12-13 22:09:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 2478 events. 1284/2478 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 14611 event pairs, 420 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 4803. Up to 1020 conditions per place. [2022-12-13 22:09:07,786 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 136 selfloop transitions, 16 changer transitions 0/156 dead transitions. [2022-12-13 22:09:07,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 948 flow [2022-12-13 22:09:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:09:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:09:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1466 transitions. [2022-12-13 22:09:07,788 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4390536088649296 [2022-12-13 22:09:07,788 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1466 transitions. [2022-12-13 22:09:07,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1466 transitions. [2022-12-13 22:09:07,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:07,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1466 transitions. [2022-12-13 22:09:07,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:07,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 477.0) internal successors, (3816), 8 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:07,793 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 477.0) internal successors, (3816), 8 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:07,794 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 365 flow. Second operand 7 states and 1466 transitions. [2022-12-13 22:09:07,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 948 flow [2022-12-13 22:09:07,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 156 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:09:07,798 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 447 flow [2022-12-13 22:09:07,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2022-12-13 22:09:07,798 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-13 22:09:07,798 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 447 flow [2022-12-13 22:09:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 192.95652173913044) internal successors, (4438), 23 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:07,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:07,799 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:07,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:09:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:09:08,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516147, now seen corresponding path program 1 times [2022-12-13 22:09:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:08,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360540442] [2022-12-13 22:09:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:08,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360540442] [2022-12-13 22:09:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360540442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:09:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471337300] [2022-12-13 22:09:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:08,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:09:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:08,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:09:08,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 22:09:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:08,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 22:09:08,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:09:08,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:08,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:08,684 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:09:08,684 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-12-13 22:09:08,693 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 22:09:08,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 22:09:08,779 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-12-13 22:09:08,884 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-12-13 22:09:09,025 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-12-13 22:09:09,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:09,084 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-12-13 22:09:09,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 63 treesize of output 56 [2022-12-13 22:09:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:09,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:09:11,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_482 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_487 (Array Int 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_482)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_483) .cse3 v_ArrVal_485)) |c_~#stored_elements~0.base| v_ArrVal_487) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_483) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_488) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_485))))) is different from false [2022-12-13 22:09:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 22:09:20,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471337300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:09:20,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:09:20,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 22:09:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291843907] [2022-12-13 22:09:20,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:09:20,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 22:09:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 22:09:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=679, Unknown=27, NotChecked=58, Total=992 [2022-12-13 22:09:20,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 477 [2022-12-13 22:09:20,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 447 flow. Second operand has 32 states, 32 states have (on average 181.40625) internal successors, (5805), 32 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:20,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:20,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 477 [2022-12-13 22:09:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:23,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:09:23,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_488 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_483) .cse5 v_ArrVal_485)) |c_~#stored_elements~0.base| v_ArrVal_487) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_488) .cse2) 2147483647) (not (<= v_ArrVal_483 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse3 v_ArrVal_485)))) (forall ((v_ArrVal_488 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_485)) |c_~#stored_elements~0.base| v_ArrVal_487) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse6 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_488) .cse2) 2147483647) (< .cse3 v_ArrVal_485))))))) is different from false [2022-12-13 22:09:24,235 INFO L130 PetriNetUnfolder]: 1305/2501 cut-off events. [2022-12-13 22:09:24,235 INFO L131 PetriNetUnfolder]: For 1564/1564 co-relation queries the response was YES. [2022-12-13 22:09:24,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 2501 events. 1305/2501 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 14615 event pairs, 1090 based on Foata normal form. 2/2317 useless extension candidates. Maximal degree in co-relation 5161. Up to 2355 conditions per place. [2022-12-13 22:09:24,242 INFO L137 encePairwiseOnDemand]: 460/477 looper letters, 78 selfloop transitions, 43 changer transitions 0/125 dead transitions. [2022-12-13 22:09:24,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 125 transitions, 965 flow [2022-12-13 22:09:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 22:09:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 22:09:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3706 transitions. [2022-12-13 22:09:24,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38846960167714883 [2022-12-13 22:09:24,247 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3706 transitions. [2022-12-13 22:09:24,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3706 transitions. [2022-12-13 22:09:24,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:24,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3706 transitions. [2022-12-13 22:09:24,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.3) internal successors, (3706), 20 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:24,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 477.0) internal successors, (10017), 21 states have internal predecessors, (10017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:24,258 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 477.0) internal successors, (10017), 21 states have internal predecessors, (10017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:24,258 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 447 flow. Second operand 20 states and 3706 transitions. [2022-12-13 22:09:24,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 125 transitions, 965 flow [2022-12-13 22:09:24,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 125 transitions, 945 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 22:09:24,262 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 814 flow [2022-12-13 22:09:24,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=814, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2022-12-13 22:09:24,263 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2022-12-13 22:09:24,263 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 814 flow [2022-12-13 22:09:24,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 181.40625) internal successors, (5805), 32 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:24,264 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:24,264 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:24,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 22:09:24,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:09:24,465 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:09:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash -466014701, now seen corresponding path program 1 times [2022-12-13 22:09:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:24,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109853769] [2022-12-13 22:09:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109853769] [2022-12-13 22:09:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109853769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:09:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818709334] [2022-12-13 22:09:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:09:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:25,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:09:25,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 22:09:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:25,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 22:09:25,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:09:25,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-12-13 22:09:25,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:25,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:25,177 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:09:25,177 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 12 treesize of output 20 [2022-12-13 22:09:25,194 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:09:25,195 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-12-13 22:09:25,262 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 25 [2022-12-13 22:09:25,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:09:25,359 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-12-13 22:09:25,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 22:09:25,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:25,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:09:25,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 22:09:25,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 22:09:25,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:09:25,592 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 25 [2022-12-13 22:09:25,672 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 22:09:25,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 22:09:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:09:25,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:09:25,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_586 (Array Int 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_584)) |c_~#stored_elements~0.base| v_ArrVal_586) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_584 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_587) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-13 22:09:28,233 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_582 Int) (v_ArrVal_586 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_582) .cse3 v_ArrVal_584)) |c_~#stored_elements~0.base| v_ArrVal_586) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_582) (< (+ (select .cse1 .cse3) 1) v_ArrVal_584) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_587) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 22:09:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 22:09:38,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818709334] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:09:38,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:09:38,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 22:09:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155219887] [2022-12-13 22:09:38,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:09:38,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 22:09:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 22:09:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=808, Unknown=26, NotChecked=126, Total=1190 [2022-12-13 22:09:38,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 22:09:38,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 814 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:38,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:38,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 22:09:38,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:41,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:43,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:45,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:47,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:49,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:51,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:53,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:55,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:57,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:09:59,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:01,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:03,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:05,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:07,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:12,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:14,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:16,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:18,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:20,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:24,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:26,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:28,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:31,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:33,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:35,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:37,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:37,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_587 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_586 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_584)) |c_~#stored_elements~0.base| v_ArrVal_586) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_584 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_587) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse2)))))) (forall ((v_ArrVal_587 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_586 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_584)) |c_~#stored_elements~0.base| v_ArrVal_586) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_587) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_584) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse5 .cse2)))))))) is different from false [2022-12-13 22:10:39,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:41,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:10:42,285 INFO L130 PetriNetUnfolder]: 1822/3474 cut-off events. [2022-12-13 22:10:42,285 INFO L131 PetriNetUnfolder]: For 2539/2539 co-relation queries the response was YES. [2022-12-13 22:10:42,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9462 conditions, 3474 events. 1822/3474 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 21446 event pairs, 524 based on Foata normal form. 18/3230 useless extension candidates. Maximal degree in co-relation 9218. Up to 2064 conditions per place. [2022-12-13 22:10:42,295 INFO L137 encePairwiseOnDemand]: 454/477 looper letters, 184 selfloop transitions, 80 changer transitions 0/268 dead transitions. [2022-12-13 22:10:42,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 268 transitions, 1847 flow [2022-12-13 22:10:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 22:10:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 22:10:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3920 transitions. [2022-12-13 22:10:42,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3913347309573725 [2022-12-13 22:10:42,300 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3920 transitions. [2022-12-13 22:10:42,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3920 transitions. [2022-12-13 22:10:42,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:42,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3920 transitions. [2022-12-13 22:10:42,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 186.66666666666666) internal successors, (3920), 21 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:42,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 477.0) internal successors, (10494), 22 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:42,313 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 477.0) internal successors, (10494), 22 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:42,313 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 814 flow. Second operand 21 states and 3920 transitions. [2022-12-13 22:10:42,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 268 transitions, 1847 flow [2022-12-13 22:10:42,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 268 transitions, 1742 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:42,323 INFO L231 Difference]: Finished difference. Result has 143 places, 146 transitions, 1200 flow [2022-12-13 22:10:42,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1200, PETRI_PLACES=143, PETRI_TRANSITIONS=146} [2022-12-13 22:10:42,324 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places. [2022-12-13 22:10:42,324 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 1200 flow [2022-12-13 22:10:42,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:42,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:42,325 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:42,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 22:10:42,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 22:10:42,526 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:10:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 500484573, now seen corresponding path program 2 times [2022-12-13 22:10:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:42,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068513196] [2022-12-13 22:10:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:43,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:43,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068513196] [2022-12-13 22:10:43,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068513196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:10:43,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823683174] [2022-12-13 22:10:43,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:10:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:10:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:10:43,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:10:43,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 22:10:43,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 22:10:43,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:10:43,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 22:10:43,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:43,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:43,337 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:10:43,337 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-12-13 22:10:43,354 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:10:43,354 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-12-13 22:10:43,451 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-12-13 22:10:43,551 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-12-13 22:10:43,633 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 40 treesize of output 42 [2022-12-13 22:10:43,760 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-12-13 22:10:43,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:43,841 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-12-13 22:10:43,998 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-12-13 22:10:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:44,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:10:44,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 22:10:44,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_687 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 22:10:44,220 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_687))))) is different from false [2022-12-13 22:10:44,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_687) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-13 22:10:44,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_685 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_686 (Array Int 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|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_685 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_687) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-12-13 22:10:44,303 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_685 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_687) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_685))))))) is different from false [2022-12-13 22:10:44,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_685 Int) (v_ArrVal_683 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_686 (Array Int Int))) (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_683)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_687) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_685))))))) is different from false [2022-12-13 22:10:44,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_685 Int) (v_ArrVal_683 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_690) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_685) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| (select .cse3 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_687) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 .cse4)))))))))) is different from false [2022-12-13 22:10:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 22:10:44,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823683174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:10:44,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:10:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 22:10:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884524316] [2022-12-13 22:10:44,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:10:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 22:10:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 22:10:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=519, Unknown=8, NotChecked=456, Total=1190 [2022-12-13 22:10:44,440 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 22:10:44,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 1200 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:44,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:44,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 22:10:44,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:47,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:10:49,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:10:51,236 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-12-13 22:10:52,989 INFO L130 PetriNetUnfolder]: 2111/4042 cut-off events. [2022-12-13 22:10:52,989 INFO L131 PetriNetUnfolder]: For 8115/8115 co-relation queries the response was YES. [2022-12-13 22:10:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14793 conditions, 4042 events. 2111/4042 cut-off events. For 8115/8115 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25956 event pairs, 730 based on Foata normal form. 9/3768 useless extension candidates. Maximal degree in co-relation 14339. Up to 2523 conditions per place. [2022-12-13 22:10:53,006 INFO L137 encePairwiseOnDemand]: 459/477 looper letters, 192 selfloop transitions, 55 changer transitions 0/251 dead transitions. [2022-12-13 22:10:53,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 251 transitions, 2329 flow [2022-12-13 22:10:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 22:10:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 22:10:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3160 transitions. [2022-12-13 22:10:53,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3896904673819213 [2022-12-13 22:10:53,011 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3160 transitions. [2022-12-13 22:10:53,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3160 transitions. [2022-12-13 22:10:53,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:53,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3160 transitions. [2022-12-13 22:10:53,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 185.88235294117646) internal successors, (3160), 17 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 477.0) internal successors, (8586), 18 states have internal predecessors, (8586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,020 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 477.0) internal successors, (8586), 18 states have internal predecessors, (8586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,020 INFO L175 Difference]: Start difference. First operand has 143 places, 146 transitions, 1200 flow. Second operand 17 states and 3160 transitions. [2022-12-13 22:10:53,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 251 transitions, 2329 flow [2022-12-13 22:10:53,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 251 transitions, 2224 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-12-13 22:10:53,038 INFO L231 Difference]: Finished difference. Result has 160 places, 168 transitions, 1472 flow [2022-12-13 22:10:53,038 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1472, PETRI_PLACES=160, PETRI_TRANSITIONS=168} [2022-12-13 22:10:53,038 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 103 predicate places. [2022-12-13 22:10:53,038 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 168 transitions, 1472 flow [2022-12-13 22:10:53,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,039 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:53,039 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:53,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 22:10:53,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 22:10:53,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:10:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1376034970, now seen corresponding path program 1 times [2022-12-13 22:10:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:53,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202018723] [2022-12-13 22:10:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202018723] [2022-12-13 22:10:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202018723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:10:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388095490] [2022-12-13 22:10:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:10:53,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:10:53,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:10:53,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 22:10:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:54,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 22:10:54,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:54,043 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:10:54,043 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-12-13 22:10:54,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 22:10:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:54,188 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-12-13 22:10:54,259 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-12-13 22:10:54,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:54,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 22:10:54,373 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 22:10:54,373 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-12-13 22:10:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:54,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:10:54,550 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_779 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_777) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_779) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_779 2147483648) 0))) is different from false [2022-12-13 22:10:54,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:10:54,771 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-12-13 22:10:54,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:10:54,784 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 669 treesize of output 661 [2022-12-13 22:10:54,793 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 770 treesize of output 750 [2022-12-13 22:10:54,808 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 894 treesize of output 846 [2022-12-13 22:10:55,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:10:55,710 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 9 treesize of output 5 [2022-12-13 22:10:55,717 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 28 treesize of output 24 [2022-12-13 22:10:55,725 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 28 treesize of output 24 [2022-12-13 22:10:55,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:10:55,738 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 213 treesize of output 201 [2022-12-13 22:10:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388095490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:10:55,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:10:55,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-12-13 22:10:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594931452] [2022-12-13 22:10:55,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:10:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 22:10:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 22:10:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=624, Unknown=6, NotChecked=52, Total=812 [2022-12-13 22:10:56,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 477 [2022-12-13 22:10:56,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 1472 flow. Second operand has 29 states, 29 states have (on average 176.6551724137931) internal successors, (5123), 29 states have internal predecessors, (5123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:56,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 477 [2022-12-13 22:10:56,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:57,858 INFO L130 PetriNetUnfolder]: 2374/4569 cut-off events. [2022-12-13 22:10:57,858 INFO L131 PetriNetUnfolder]: For 17035/17037 co-relation queries the response was YES. [2022-12-13 22:10:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19270 conditions, 4569 events. 2374/4569 cut-off events. For 17035/17037 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 30159 event pairs, 846 based on Foata normal form. 27/4262 useless extension candidates. Maximal degree in co-relation 18700. Up to 2199 conditions per place. [2022-12-13 22:10:57,878 INFO L137 encePairwiseOnDemand]: 466/477 looper letters, 204 selfloop transitions, 48 changer transitions 0/256 dead transitions. [2022-12-13 22:10:57,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 256 transitions, 2643 flow [2022-12-13 22:10:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:10:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 22:10:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2605 transitions. [2022-12-13 22:10:57,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3900868523510033 [2022-12-13 22:10:57,881 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2605 transitions. [2022-12-13 22:10:57,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2605 transitions. [2022-12-13 22:10:57,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:57,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2605 transitions. [2022-12-13 22:10:57,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 186.07142857142858) internal successors, (2605), 14 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 477.0) internal successors, (7155), 15 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,888 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 477.0) internal successors, (7155), 15 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,888 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 1472 flow. Second operand 14 states and 2605 transitions. [2022-12-13 22:10:57,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 256 transitions, 2643 flow [2022-12-13 22:10:57,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 256 transitions, 2510 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-12-13 22:10:57,908 INFO L231 Difference]: Finished difference. Result has 169 places, 172 transitions, 1517 flow [2022-12-13 22:10:57,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1517, PETRI_PLACES=169, PETRI_TRANSITIONS=172} [2022-12-13 22:10:57,908 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 112 predicate places. [2022-12-13 22:10:57,908 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 172 transitions, 1517 flow [2022-12-13 22:10:57,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 176.6551724137931) internal successors, (5123), 29 states have internal predecessors, (5123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:57,909 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:57,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 22:10:58,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 22:10:58,111 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:10:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -931580537, now seen corresponding path program 3 times [2022-12-13 22:10:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:58,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127027317] [2022-12-13 22:10:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:58,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127027317] [2022-12-13 22:10:58,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127027317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:10:58,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393595555] [2022-12-13 22:10:58,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 22:10:58,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:10:58,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:10:58,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:10:58,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 22:10:58,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 22:10:58,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:10:58,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 22:10:58,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:58,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:58,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:58,818 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:10:58,818 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-12-13 22:10:58,833 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:10:58,833 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-12-13 22:10:58,945 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-12-13 22:10:59,070 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-12-13 22:10:59,241 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-12-13 22:10:59,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:10:59,325 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-12-13 22:10:59,400 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-12-13 22:10:59,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 63 treesize of output 56 [2022-12-13 22:10:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:59,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:10:59,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_879) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_882) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-13 22:10:59,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_877 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_877)) |c_~#stored_elements~0.base| v_ArrVal_879) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_877) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_882) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 22:11:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:11:12,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393595555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:11:12,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:11:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 22:11:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156770717] [2022-12-13 22:11:12,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:11:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 22:11:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 22:11:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=790, Unknown=25, NotChecked=126, Total=1190 [2022-12-13 22:11:12,684 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 22:11:12,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 172 transitions, 1517 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:12,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:12,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 22:11:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:21,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:11:23,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:11:25,923 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-12-13 22:11:32,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:34,316 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-12-13 22:11:36,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:37,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:41,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:43,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:45,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:48,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:50,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:11:52,157 INFO L130 PetriNetUnfolder]: 3933/7547 cut-off events. [2022-12-13 22:11:52,157 INFO L131 PetriNetUnfolder]: For 27313/27313 co-relation queries the response was YES. [2022-12-13 22:11:52,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30744 conditions, 7547 events. 3933/7547 cut-off events. For 27313/27313 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 55544 event pairs, 1407 based on Foata normal form. 18/6981 useless extension candidates. Maximal degree in co-relation 30161. Up to 2890 conditions per place. [2022-12-13 22:11:52,191 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 297 selfloop transitions, 143 changer transitions 0/444 dead transitions. [2022-12-13 22:11:52,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 444 transitions, 4539 flow [2022-12-13 22:11:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 22:11:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 22:11:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5606 transitions. [2022-12-13 22:11:52,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3917540181691125 [2022-12-13 22:11:52,196 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5606 transitions. [2022-12-13 22:11:52,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5606 transitions. [2022-12-13 22:11:52,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:52,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5606 transitions. [2022-12-13 22:11:52,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 186.86666666666667) internal successors, (5606), 30 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:52,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 477.0) internal successors, (14787), 31 states have internal predecessors, (14787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:52,209 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 477.0) internal successors, (14787), 31 states have internal predecessors, (14787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:52,209 INFO L175 Difference]: Start difference. First operand has 169 places, 172 transitions, 1517 flow. Second operand 30 states and 5606 transitions. [2022-12-13 22:11:52,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 444 transitions, 4539 flow [2022-12-13 22:11:52,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 444 transitions, 4466 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 22:11:52,255 INFO L231 Difference]: Finished difference. Result has 200 places, 238 transitions, 2593 flow [2022-12-13 22:11:52,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2593, PETRI_PLACES=200, PETRI_TRANSITIONS=238} [2022-12-13 22:11:52,256 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 143 predicate places. [2022-12-13 22:11:52,256 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 238 transitions, 2593 flow [2022-12-13 22:11:52,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:52,257 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:52,257 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:52,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 22:11:52,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 22:11:52,458 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:11:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -931325717, now seen corresponding path program 4 times [2022-12-13 22:11:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214523721] [2022-12-13 22:11:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:11:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214523721] [2022-12-13 22:11:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214523721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:11:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840433830] [2022-12-13 22:11:53,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:11:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:11:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:11:53,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:11:53,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 22:11:53,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:11:53,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:11:53,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 22:11:53,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:11:53,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:11:53,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:11:53,372 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:11:53,372 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-12-13 22:11:53,384 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:11:53,384 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-12-13 22:11:53,471 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-12-13 22:11:53,597 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-12-13 22:11:53,800 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-12-13 22:11:53,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:11:53,881 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-12-13 22:11:54,035 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-12-13 22:11:54,383 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-12-13 22:11:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:11:54,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:11:54,788 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-13 22:11:54,802 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_982 (Array Int 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_981 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 22:11:54,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_981) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-13 22:11:54,934 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_978) .cse4 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_978 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ .cse0 1) v_ArrVal_981) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) (= 400 .cse0)))) is different from false [2022-12-13 22:11:55,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 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_976)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_978) .cse5 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse4 (select .cse2 .cse5)) (.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_978) (< (+ .cse4 1) v_ArrVal_981) (= .cse4 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse1 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-12-13 22:11:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 22:11:59,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840433830] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:11:59,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:11:59,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2022-12-13 22:11:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879730249] [2022-12-13 22:11:59,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:11:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 22:11:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 22:11:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=20, NotChecked=310, Total=1260 [2022-12-13 22:11:59,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 22:11:59,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 238 transitions, 2593 flow. Second operand has 36 states, 36 states have (on average 177.33333333333334) internal successors, (6384), 36 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:59,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:59,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 22:11:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:12:08,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:12:17,424 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 169 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:12:19,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:12:21,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:12:23,602 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-12-13 22:12:24,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse1 1) v_ArrVal_981) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) (and .cse0 (or .cse0 (= 400 .cse1)))))) is different from false [2022-12-13 22:12:24,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse6 .cse8))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ .cse11 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (= 400 .cse11))) (and (or .cse0 (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_978) .cse8 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< .cse1 v_ArrVal_981) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse3 .cse5))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_978))))))) (or (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse8 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse9 .cse5))) (< .cse1 v_ArrVal_981) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse4) 2147483647))))) .cse0))))) is different from false [2022-12-13 22:12:25,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int))) (< (select (select (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_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) (forall ((v_ArrVal_985 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2022-12-13 22:12:27,679 INFO L130 PetriNetUnfolder]: 5185/9846 cut-off events. [2022-12-13 22:12:27,680 INFO L131 PetriNetUnfolder]: For 95901/95901 co-relation queries the response was YES. [2022-12-13 22:12:27,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53708 conditions, 9846 events. 5185/9846 cut-off events. For 95901/95901 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 75490 event pairs, 1866 based on Foata normal form. 36/9150 useless extension candidates. Maximal degree in co-relation 52524. Up to 4410 conditions per place. [2022-12-13 22:12:27,742 INFO L137 encePairwiseOnDemand]: 454/477 looper letters, 255 selfloop transitions, 202 changer transitions 0/461 dead transitions. [2022-12-13 22:12:27,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 461 transitions, 6461 flow [2022-12-13 22:12:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 22:12:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 22:12:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4468 transitions. [2022-12-13 22:12:27,747 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39028651292802236 [2022-12-13 22:12:27,747 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4468 transitions. [2022-12-13 22:12:27,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4468 transitions. [2022-12-13 22:12:27,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:12:27,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4468 transitions. [2022-12-13 22:12:27,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 186.16666666666666) internal successors, (4468), 24 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:27,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 477.0) internal successors, (11925), 25 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:27,758 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 477.0) internal successors, (11925), 25 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:27,758 INFO L175 Difference]: Start difference. First operand has 200 places, 238 transitions, 2593 flow. Second operand 24 states and 4468 transitions. [2022-12-13 22:12:27,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 461 transitions, 6461 flow [2022-12-13 22:12:27,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 461 transitions, 5850 flow, removed 227 selfloop flow, removed 14 redundant places. [2022-12-13 22:12:27,838 INFO L231 Difference]: Finished difference. Result has 221 places, 352 transitions, 4338 flow [2022-12-13 22:12:27,838 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4338, PETRI_PLACES=221, PETRI_TRANSITIONS=352} [2022-12-13 22:12:27,839 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 164 predicate places. [2022-12-13 22:12:27,839 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 352 transitions, 4338 flow [2022-12-13 22:12:27,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 177.33333333333334) internal successors, (6384), 36 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:27,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:12:27,840 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:12:27,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 22:12:28,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 22:12:28,041 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:12:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:12:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1656300709, now seen corresponding path program 1 times [2022-12-13 22:12:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:12:28,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494773955] [2022-12-13 22:12:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:12:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:12:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:12:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494773955] [2022-12-13 22:12:28,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494773955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:12:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388935130] [2022-12-13 22:12:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:28,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:12:28,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:12:28,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:12:28,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 22:12:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:28,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 22:12:28,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:12:28,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:28,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:28,545 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:12:28,546 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-12-13 22:12:28,554 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 22:12:28,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 22:12:28,642 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-12-13 22:12:28,717 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-12-13 22:12:28,861 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-12-13 22:12:28,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:28,919 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-12-13 22:12:29,100 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-12-13 22:12:29,203 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-12-13 22:12:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:12:29,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:12:29,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1084 Int) (v_ArrVal_1079 Int) (v_ArrVal_1083 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| Int)) (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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1079) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| 4) |c_~#queue~0.offset|) v_ArrVal_1084) .cse1) 2147483650))))) is different from false [2022-12-13 22:12:29,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1084 Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1083 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_1077)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1079) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| 4) |c_~#queue~0.offset|) v_ArrVal_1084) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| (select .cse0 .cse1)))))) is different from false [2022-12-13 22:12:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 22:12:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388935130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:12:29,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:12:29,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-12-13 22:12:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539599834] [2022-12-13 22:12:29,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:12:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 22:12:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:12:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 22:12:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=463, Unknown=16, NotChecked=94, Total=702 [2022-12-13 22:12:29,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 477 [2022-12-13 22:12:29,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 352 transitions, 4338 flow. Second operand has 27 states, 27 states have (on average 187.0) internal successors, (5049), 27 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:29,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:12:29,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 477 [2022-12-13 22:12:29,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:12:32,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:12:41,476 INFO L130 PetriNetUnfolder]: 7657/14455 cut-off events. [2022-12-13 22:12:41,476 INFO L131 PetriNetUnfolder]: For 461158/461162 co-relation queries the response was YES. [2022-12-13 22:12:41,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108464 conditions, 14455 events. 7657/14455 cut-off events. For 461158/461162 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 118088 event pairs, 2636 based on Foata normal form. 171/13503 useless extension candidates. Maximal degree in co-relation 107034. Up to 5705 conditions per place. [2022-12-13 22:12:41,617 INFO L137 encePairwiseOnDemand]: 456/477 looper letters, 420 selfloop transitions, 215 changer transitions 0/639 dead transitions. [2022-12-13 22:12:41,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 639 transitions, 10219 flow [2022-12-13 22:12:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 22:12:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 22:12:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4660 transitions. [2022-12-13 22:12:41,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40705800139762405 [2022-12-13 22:12:41,624 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4660 transitions. [2022-12-13 22:12:41,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4660 transitions. [2022-12-13 22:12:41,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:12:41,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4660 transitions. [2022-12-13 22:12:41,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 194.16666666666666) internal successors, (4660), 24 states have internal predecessors, (4660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:41,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 477.0) internal successors, (11925), 25 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:41,639 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 477.0) internal successors, (11925), 25 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:41,639 INFO L175 Difference]: Start difference. First operand has 221 places, 352 transitions, 4338 flow. Second operand 24 states and 4660 transitions. [2022-12-13 22:12:41,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 639 transitions, 10219 flow [2022-12-13 22:12:41,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 639 transitions, 8657 flow, removed 723 selfloop flow, removed 12 redundant places. [2022-12-13 22:12:41,850 INFO L231 Difference]: Finished difference. Result has 236 places, 429 transitions, 5067 flow [2022-12-13 22:12:41,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5067, PETRI_PLACES=236, PETRI_TRANSITIONS=429} [2022-12-13 22:12:41,851 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places. [2022-12-13 22:12:41,851 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 429 transitions, 5067 flow [2022-12-13 22:12:41,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 187.0) internal successors, (5049), 27 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:41,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:12:41,852 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:12:41,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 22:12:42,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 22:12:42,053 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:12:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:12:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1359211472, now seen corresponding path program 1 times [2022-12-13 22:12:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:12:42,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506399217] [2022-12-13 22:12:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:12:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:12:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:12:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506399217] [2022-12-13 22:12:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506399217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:12:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75012306] [2022-12-13 22:12:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:12:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:12:42,600 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:12:42,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 22:12:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:42,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 22:12:42,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:12:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:42,742 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:12:42,743 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-12-13 22:12:42,761 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:12:42,762 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-12-13 22:12:42,851 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-12-13 22:12:42,912 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-12-13 22:12:43,051 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-12-13 22:12:43,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:12:43,101 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-12-13 22:12:43,154 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-12-13 22:12:43,264 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 60 treesize of output 53 [2022-12-13 22:12:43,350 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 59 treesize of output 54 [2022-12-13 22:12:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:12:43,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:12:43,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1192 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1192)) .cse1)) 2147483647)) is different from false [2022-12-13 22:12:45,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (v_ArrVal_1192 Int)) (or (not (<= v_ArrVal_1188 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1188)) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1192)) .cse1)) 2147483647))) is different from false [2022-12-13 22:12:45,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (v_ArrVal_1192 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1188) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1188)) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1192)) .cse3)) 2147483647)))) is different from false [2022-12-13 22:12:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 22:12:54,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75012306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:12:54,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:12:54,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 22:12:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248618345] [2022-12-13 22:12:54,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:12:54,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 22:12:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:12:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 22:12:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=552, Unknown=13, NotChecked=162, Total=930 [2022-12-13 22:12:54,193 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 22:12:54,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 429 transitions, 5067 flow. Second operand has 31 states, 31 states have (on average 183.83870967741936) internal successors, (5699), 31 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:54,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:12:54,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 22:12:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:13:03,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:06,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:08,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:10,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:12,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:20,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:22,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:23,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:26,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:32,460 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1184 Int) (v_ArrVal_1187 Int) (v_ArrVal_1188 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1192 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| 4) |c_~#queue~0.offset|) v_ArrVal_1184))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1187) .cse1 v_ArrVal_1188)) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1192)) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1188) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| (select .cse3 .cse1))))))) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (v_ArrVal_1192 Int)) (or (not (<= v_ArrVal_1188 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1188)) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_1192)) .cse1) 2147483647))))) is different from false [2022-12-13 22:13:33,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:36,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:38,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:38,405 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1192 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1192)) .cse1) 2147483647)) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1192 Int)) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1192)) .cse1) 2147483647)))) is different from false [2022-12-13 22:13:40,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:42,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:44,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:46,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:47,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:49,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:50,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:52,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:54,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:56,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:13:58,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:00,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:02,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:05,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:07,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 [1] [2022-12-13 22:14:09,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:11,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:14:17,639 INFO L130 PetriNetUnfolder]: 9838/18457 cut-off events. [2022-12-13 22:14:17,639 INFO L131 PetriNetUnfolder]: For 598655/598659 co-relation queries the response was YES. [2022-12-13 22:14:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143107 conditions, 18457 events. 9838/18457 cut-off events. For 598655/598659 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 153665 event pairs, 3869 based on Foata normal form. 193/17331 useless extension candidates. Maximal degree in co-relation 141429. Up to 8837 conditions per place. [2022-12-13 22:14:17,786 INFO L137 encePairwiseOnDemand]: 456/477 looper letters, 569 selfloop transitions, 328 changer transitions 0/901 dead transitions. [2022-12-13 22:14:17,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 901 transitions, 14393 flow [2022-12-13 22:14:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 22:14:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 22:14:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 6199 transitions. [2022-12-13 22:14:17,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40611897274633124 [2022-12-13 22:14:17,792 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 6199 transitions. [2022-12-13 22:14:17,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 6199 transitions. [2022-12-13 22:14:17,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:14:17,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 6199 transitions. [2022-12-13 22:14:17,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 193.71875) internal successors, (6199), 32 states have internal predecessors, (6199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:17,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 477.0) internal successors, (15741), 33 states have internal predecessors, (15741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:17,806 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 477.0) internal successors, (15741), 33 states have internal predecessors, (15741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:17,806 INFO L175 Difference]: Start difference. First operand has 236 places, 429 transitions, 5067 flow. Second operand 32 states and 6199 transitions. [2022-12-13 22:14:17,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 901 transitions, 14393 flow [2022-12-13 22:14:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 901 transitions, 14103 flow, removed 123 selfloop flow, removed 13 redundant places. [2022-12-13 22:14:18,112 INFO L231 Difference]: Finished difference. Result has 271 places, 623 transitions, 9122 flow [2022-12-13 22:14:18,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=4725, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=9122, PETRI_PLACES=271, PETRI_TRANSITIONS=623} [2022-12-13 22:14:18,113 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 214 predicate places. [2022-12-13 22:14:18,113 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 623 transitions, 9122 flow [2022-12-13 22:14:18,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 183.83870967741936) internal successors, (5699), 31 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:18,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:14:18,113 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:14:18,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 22:14:18,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:18,315 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:14:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:14:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash 194328013, now seen corresponding path program 1 times [2022-12-13 22:14:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:14:18,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653229940] [2022-12-13 22:14:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:14:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:14:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653229940] [2022-12-13 22:14:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653229940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:14:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092215335] [2022-12-13 22:14:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:18,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:18,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:14:18,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:14:18,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 22:14:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:18,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 22:14:18,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:14:18,975 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 22:14:18,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 22:14:19,133 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-12-13 22:14:19,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:14:19,167 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-12-13 22:14:19,234 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 22:14:19,234 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 33 [2022-12-13 22:14:19,267 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 28 [2022-12-13 22:14:19,275 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-12-13 22:14:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:19,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:14:19,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1285)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1287) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))))) is different from false [2022-12-13 22:14:19,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:14:19,738 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 122 treesize of output 68 [2022-12-13 22:14:19,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:14:19,748 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 113 treesize of output 113 [2022-12-13 22:14:19,752 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 88 treesize of output 80 [2022-12-13 22:14:19,756 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 55 treesize of output 43 [2022-12-13 22:14:19,768 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-12-13 22:14:19,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:14:19,782 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 79 treesize of output 67 [2022-12-13 22:14:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 22:14:19,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092215335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:14:19,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:14:19,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2022-12-13 22:14:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029956781] [2022-12-13 22:14:19,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:14:19,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 22:14:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:14:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 22:14:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=671, Unknown=12, NotChecked=54, Total=870 [2022-12-13 22:14:20,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 22:14:20,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 623 transitions, 9122 flow. Second operand has 30 states, 30 states have (on average 183.9) internal successors, (5517), 30 states have internal predecessors, (5517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:20,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:14:20,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 22:14:20,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:14:26,748 INFO L130 PetriNetUnfolder]: 10922/20914 cut-off events. [2022-12-13 22:14:26,748 INFO L131 PetriNetUnfolder]: For 1425419/1425427 co-relation queries the response was YES. [2022-12-13 22:14:26,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205317 conditions, 20914 events. 10922/20914 cut-off events. For 1425419/1425427 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 173307 event pairs, 4051 based on Foata normal form. 454/19841 useless extension candidates. Maximal degree in co-relation 202741. Up to 9108 conditions per place. [2022-12-13 22:14:26,981 INFO L137 encePairwiseOnDemand]: 466/477 looper letters, 507 selfloop transitions, 208 changer transitions 0/719 dead transitions. [2022-12-13 22:14:26,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 719 transitions, 12859 flow [2022-12-13 22:14:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:14:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:14:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2923 transitions. [2022-12-13 22:14:26,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4085255066387142 [2022-12-13 22:14:26,985 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2923 transitions. [2022-12-13 22:14:26,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2923 transitions. [2022-12-13 22:14:26,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:14:26,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2923 transitions. [2022-12-13 22:14:26,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 194.86666666666667) internal successors, (2923), 15 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:26,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 477.0) internal successors, (7632), 16 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:26,992 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 477.0) internal successors, (7632), 16 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:26,992 INFO L175 Difference]: Start difference. First operand has 271 places, 623 transitions, 9122 flow. Second operand 15 states and 2923 transitions. [2022-12-13 22:14:26,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 719 transitions, 12859 flow [2022-12-13 22:14:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 719 transitions, 11494 flow, removed 526 selfloop flow, removed 14 redundant places. [2022-12-13 22:14:27,520 INFO L231 Difference]: Finished difference. Result has 267 places, 584 transitions, 7736 flow [2022-12-13 22:14:27,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=6718, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7736, PETRI_PLACES=267, PETRI_TRANSITIONS=584} [2022-12-13 22:14:27,521 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 210 predicate places. [2022-12-13 22:14:27,521 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 584 transitions, 7736 flow [2022-12-13 22:14:27,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 183.9) internal successors, (5517), 30 states have internal predecessors, (5517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:27,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:14:27,522 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:14:27,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 22:14:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:27,724 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:14:27,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:14:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -5705404, now seen corresponding path program 1 times [2022-12-13 22:14:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:14:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635013972] [2022-12-13 22:14:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:14:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:14:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635013972] [2022-12-13 22:14:27,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635013972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:14:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075481793] [2022-12-13 22:14:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:14:27,824 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:14:27,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 22:14:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:27,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 22:14:27,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:14:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:27,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:14:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075481793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:14:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:14:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 22:14:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636964248] [2022-12-13 22:14:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:14:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:14:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:14:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:14:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:14:27,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 22:14:27,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 584 transitions, 7736 flow. Second operand has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:27,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:14:27,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 22:14:27,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:14:32,849 INFO L130 PetriNetUnfolder]: 10616/20538 cut-off events. [2022-12-13 22:14:32,849 INFO L131 PetriNetUnfolder]: For 1184732/1184732 co-relation queries the response was YES. [2022-12-13 22:14:32,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189821 conditions, 20538 events. 10616/20538 cut-off events. For 1184732/1184732 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 172034 event pairs, 4766 based on Foata normal form. 0/19307 useless extension candidates. Maximal degree in co-relation 187156. Up to 18766 conditions per place. [2022-12-13 22:14:33,049 INFO L137 encePairwiseOnDemand]: 474/477 looper letters, 563 selfloop transitions, 6 changer transitions 0/573 dead transitions. [2022-12-13 22:14:33,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 573 transitions, 9009 flow [2022-12-13 22:14:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:14:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:14:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1012 transitions. [2022-12-13 22:14:33,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5303983228511531 [2022-12-13 22:14:33,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1012 transitions. [2022-12-13 22:14:33,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1012 transitions. [2022-12-13 22:14:33,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:14:33,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1012 transitions. [2022-12-13 22:14:33,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:33,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:33,054 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:33,054 INFO L175 Difference]: Start difference. First operand has 267 places, 584 transitions, 7736 flow. Second operand 4 states and 1012 transitions. [2022-12-13 22:14:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 573 transitions, 9009 flow [2022-12-13 22:14:33,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 573 transitions, 8753 flow, removed 66 selfloop flow, removed 7 redundant places. [2022-12-13 22:14:33,467 INFO L231 Difference]: Finished difference. Result has 262 places, 562 transitions, 7190 flow [2022-12-13 22:14:33,467 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=7178, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7190, PETRI_PLACES=262, PETRI_TRANSITIONS=562} [2022-12-13 22:14:33,467 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 205 predicate places. [2022-12-13 22:14:33,467 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 562 transitions, 7190 flow [2022-12-13 22:14:33,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:33,468 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:14:33,468 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:14:33,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 22:14:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 22:14:33,669 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:14:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:14:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1181196047, now seen corresponding path program 1 times [2022-12-13 22:14:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:14:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416582535] [2022-12-13 22:14:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:14:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 22:14:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:14:33,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416582535] [2022-12-13 22:14:33,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416582535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:14:33,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:14:33,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:14:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463322575] [2022-12-13 22:14:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:14:33,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:14:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:14:33,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:14:33,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:14:33,748 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 22:14:33,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 562 transitions, 7190 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:33,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:14:33,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 22:14:33,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:14:38,652 INFO L130 PetriNetUnfolder]: 10310/20188 cut-off events. [2022-12-13 22:14:38,652 INFO L131 PetriNetUnfolder]: For 1162575/1162575 co-relation queries the response was YES. [2022-12-13 22:14:38,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183852 conditions, 20188 events. 10310/20188 cut-off events. For 1162575/1162575 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 170981 event pairs, 5859 based on Foata normal form. 288/19250 useless extension candidates. Maximal degree in co-relation 181188. Up to 12789 conditions per place. [2022-12-13 22:14:38,837 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 487 selfloop transitions, 55 changer transitions 0/546 dead transitions. [2022-12-13 22:14:38,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 546 transitions, 8198 flow [2022-12-13 22:14:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:14:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:14:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-12-13 22:14:38,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5303983228511531 [2022-12-13 22:14:38,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2022-12-13 22:14:38,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2022-12-13 22:14:38,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:14:38,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2022-12-13 22:14:38,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:38,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:38,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:38,841 INFO L175 Difference]: Start difference. First operand has 262 places, 562 transitions, 7190 flow. Second operand 3 states and 759 transitions. [2022-12-13 22:14:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 546 transitions, 8198 flow [2022-12-13 22:14:39,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 546 transitions, 8146 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-13 22:14:39,208 INFO L231 Difference]: Finished difference. Result has 257 places, 539 transitions, 6937 flow [2022-12-13 22:14:39,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=6827, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6937, PETRI_PLACES=257, PETRI_TRANSITIONS=539} [2022-12-13 22:14:39,209 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 200 predicate places. [2022-12-13 22:14:39,209 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 539 transitions, 6937 flow [2022-12-13 22:14:39,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:39,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:14:39,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:14:39,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 22:14:39,209 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:14:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:14:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1886173525, now seen corresponding path program 1 times [2022-12-13 22:14:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:14:39,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264280515] [2022-12-13 22:14:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:14:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:14:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264280515] [2022-12-13 22:14:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264280515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:14:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331818906] [2022-12-13 22:14:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:39,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:14:39,241 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:14:39,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 22:14:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:39,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 22:14:39,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:14:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:39,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:14:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:39,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331818906] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:14:39,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:14:39,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 22:14:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507438984] [2022-12-13 22:14:39,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:14:39,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:14:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:14:39,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:14:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:14:39,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 22:14:39,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 539 transitions, 6937 flow. Second operand has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:39,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:14:39,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 22:14:39,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:14:42,794 INFO L130 PetriNetUnfolder]: 6916/13238 cut-off events. [2022-12-13 22:14:42,794 INFO L131 PetriNetUnfolder]: For 896351/896351 co-relation queries the response was YES. [2022-12-13 22:14:42,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146680 conditions, 13238 events. 6916/13238 cut-off events. For 896351/896351 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 95871 event pairs, 2656 based on Foata normal form. 292/13056 useless extension candidates. Maximal degree in co-relation 143370. Up to 4970 conditions per place. [2022-12-13 22:14:42,943 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 531 selfloop transitions, 36 changer transitions 0/571 dead transitions. [2022-12-13 22:14:42,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 571 transitions, 8947 flow [2022-12-13 22:14:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:14:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:14:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1510 transitions. [2022-12-13 22:14:42,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.527603074772886 [2022-12-13 22:14:42,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1510 transitions. [2022-12-13 22:14:42,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1510 transitions. [2022-12-13 22:14:42,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:14:42,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1510 transitions. [2022-12-13 22:14:42,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.66666666666666) internal successors, (1510), 6 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:42,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 477.0) internal successors, (3339), 7 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:42,950 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 477.0) internal successors, (3339), 7 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:42,950 INFO L175 Difference]: Start difference. First operand has 257 places, 539 transitions, 6937 flow. Second operand 6 states and 1510 transitions. [2022-12-13 22:14:42,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 571 transitions, 8947 flow [2022-12-13 22:14:43,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 571 transitions, 8850 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 22:14:43,314 INFO L231 Difference]: Finished difference. Result has 265 places, 524 transitions, 6650 flow [2022-12-13 22:14:43,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=6355, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6650, PETRI_PLACES=265, PETRI_TRANSITIONS=524} [2022-12-13 22:14:43,315 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 208 predicate places. [2022-12-13 22:14:43,315 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 524 transitions, 6650 flow [2022-12-13 22:14:43,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:43,315 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:14:43,315 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 22:14:43,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 22:14:43,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 22:14:43,517 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:14:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:14:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 70523137, now seen corresponding path program 5 times [2022-12-13 22:14:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:14:43,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256795110] [2022-12-13 22:14:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:14:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:14:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:14:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:14:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256795110] [2022-12-13 22:14:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256795110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:14:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85251469] [2022-12-13 22:14:45,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 22:14:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:14:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:14:45,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:14:45,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 22:14:45,249 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 22:14:45,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:14:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 22:14:45,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:14:45,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:14:45,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:14:45,285 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 22:14:45,286 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-12-13 22:14:45,302 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 22:14:45,303 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-12-13 22:14:45,473 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-12-13 22:14:45,611 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-12-13 22:14:45,846 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-12-13 22:14:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:14:45,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-12-13 22:14:46,097 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-12-13 22:14:46,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2022-12-13 22:14:46,514 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 66 treesize of output 59 [2022-12-13 22:14:46,927 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 71 treesize of output 64 [2022-12-13 22:14:47,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:14:47,182 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 58 treesize of output 60 [2022-12-13 22:14:47,705 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 76 treesize of output 69 [2022-12-13 22:14:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:14:48,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:14:49,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1625 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 22:14:49,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1622) (not (<= v_ArrVal_1621 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-13 22:14:49,711 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1625 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_1617))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1622) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1621) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-13 22:14:49,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1622) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1621) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse5 .cse1)))))))))) is different from false [2022-12-13 22:14:49,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1621) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1622))))))))) is different from false [2022-12-13 22:14:49,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1621) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1622) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse4) 2147483647) (not (<= v_ArrVal_1614 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))))))))) is different from false [2022-12-13 22:14:49,856 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1621) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1622) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse4) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1614)))))))))) is different from false [2022-12-13 22:14:49,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1621) .cse2 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse3 .cse2))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1621) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1622) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse5) 2147483647) (< (+ .cse0 1) v_ArrVal_1614)))))))))))) is different from false [2022-12-13 22:14:49,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1613) .cse10 v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1621) .cse2 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse1 .cse2))) (not (<= v_ArrVal_1613 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1621) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse5 .cse2))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1622) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse4) 2147483647) (< (+ .cse0 1) v_ArrVal_1614)))))))))))) is different from false [2022-12-13 22:14:50,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse11))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1613) .cse11 v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1621) .cse1 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1621) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1622) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse3) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1613) (< (+ .cse8 1) v_ArrVal_1614)))))))))) (= 400 .cse8)))) is different from false [2022-12-13 22:14:50,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1611 Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1614 Int) (v_ArrVal_1616 (Array Int Int)) (v_ArrVal_1625 Int)) (let ((.cse5 (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_1611)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1613) .cse9 v_ArrVal_1614)) |c_~#stored_elements~0.base| v_ArrVal_1616))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1617))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1619))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1621) .cse3 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse9))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse1) 2147483647) (= 400 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1622) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1613) (< (+ .cse2 1) v_ArrVal_1614) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1621) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse8 .cse3)))))))))))) is different from false [2022-12-13 22:14:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-13 22:14:55,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85251469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:14:55,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:14:55,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 55 [2022-12-13 22:14:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99999410] [2022-12-13 22:14:55,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:14:55,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-13 22:14:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:14:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-13 22:14:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=1614, Unknown=35, NotChecked=1078, Total=3192 [2022-12-13 22:14:55,497 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 477 [2022-12-13 22:14:55,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 524 transitions, 6650 flow. Second operand has 57 states, 57 states have (on average 171.26315789473685) internal successors, (9762), 57 states have internal predecessors, (9762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:14:55,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:14:55,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 477 [2022-12-13 22:14:55,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:15:14,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:15:24,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:15:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:15:33,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:15:41,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:15:45,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:15:46,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:15:58,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:16:00,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:16:05,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:16:07,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:16:22,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:16:33,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:04,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:15,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:18,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, 1] [2022-12-13 22:17:20,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:30,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:32,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:35,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:37,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:37,161 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1625 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse1))) (< .cse2 v_ArrVal_1622) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse3) 2147483647)))) (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1621 Int) (v_ArrVal_1625 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1621) .cse5 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1621 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse6 .cse1))) (< .cse2 v_ArrVal_1622))))))) is different from false [2022-12-13 22:17:39,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:50,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:52,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, 1] [2022-12-13 22:17:55,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:57,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:17:57,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1625 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1622) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse4) 2147483647)))) (forall ((v_ArrVal_1624 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1622 Int) (v_ArrVal_1625 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1622)) |c_~#stored_elements~0.base| v_ArrVal_1624) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1622 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse5 .cse1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1625) .cse4) 2147483647)))))) is different from false [2022-12-13 22:17:59,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:18:02,187 INFO L130 PetriNetUnfolder]: 7557/14426 cut-off events. [2022-12-13 22:18:02,187 INFO L131 PetriNetUnfolder]: For 1001587/1001587 co-relation queries the response was YES. [2022-12-13 22:18:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165507 conditions, 14426 events. 7557/14426 cut-off events. For 1001587/1001587 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 105158 event pairs, 3046 based on Foata normal form. 61/14013 useless extension candidates. Maximal degree in co-relation 159898. Up to 8439 conditions per place. [2022-12-13 22:18:02,372 INFO L137 encePairwiseOnDemand]: 460/477 looper letters, 438 selfloop transitions, 345 changer transitions 0/787 dead transitions. [2022-12-13 22:18:02,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 787 transitions, 16631 flow [2022-12-13 22:18:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 22:18:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-13 22:18:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7629 transitions. [2022-12-13 22:18:02,378 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3719467602749744 [2022-12-13 22:18:02,378 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7629 transitions. [2022-12-13 22:18:02,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7629 transitions. [2022-12-13 22:18:02,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:18:02,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7629 transitions. [2022-12-13 22:18:02,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 177.41860465116278) internal successors, (7629), 43 states have internal predecessors, (7629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:18:02,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 477.0) internal successors, (20988), 44 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:18:02,396 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 477.0) internal successors, (20988), 44 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:18:02,396 INFO L175 Difference]: Start difference. First operand has 265 places, 524 transitions, 6650 flow. Second operand 43 states and 7629 transitions. [2022-12-13 22:18:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 787 transitions, 16631 flow [2022-12-13 22:18:02,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 787 transitions, 16558 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 22:18:02,828 INFO L231 Difference]: Finished difference. Result has 329 places, 631 transitions, 10230 flow [2022-12-13 22:18:02,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=6587, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10230, PETRI_PLACES=329, PETRI_TRANSITIONS=631} [2022-12-13 22:18:02,828 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 272 predicate places. [2022-12-13 22:18:02,828 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 631 transitions, 10230 flow [2022-12-13 22:18:02,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 171.26315789473685) internal successors, (9762), 57 states have internal predecessors, (9762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:18:02,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:18:02,829 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 22:18:02,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 22:18:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:18:03,031 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 22:18:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:18:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash 95976763, now seen corresponding path program 6 times [2022-12-13 22:18:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:18:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749083195] [2022-12-13 22:18:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:18:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:18:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:18:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:18:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:18:04,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749083195] [2022-12-13 22:18:04,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749083195] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:18:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850454269] [2022-12-13 22:18:04,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 22:18:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:18:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:18:04,482 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:18:04,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8699f4b0-f9e6-4bd9-89eb-3219da3d5426/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 22:18:04,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 22:18:04,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:18:04,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 22:18:04,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:18:04,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:18:04,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:18:04,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 22:18:04,801 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-13 22:18:04,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-13 22:18:04,938 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-12-13 22:18:05,100 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-12-13 22:18:05,319 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-12-13 22:18:05,417 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-12-13 22:18:05,579 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-12-13 22:18:05,927 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-12-13 22:18:06,590 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-12-13 22:18:07,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-13 22:18:08,407 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-12-13 22:18:09,154 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-12-13 22:18:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:18:19,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:18:29,887 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 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_1743)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1746) .cse3 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1746) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1748))))) is different from false [2022-12-13 22:18:49,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1746) .cse3 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1746) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse4 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1748) (not (<= v_ArrVal_1740 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647))))))) is different from false [2022-12-13 22:18:49,247 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1746) .cse5 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1746) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse6 .cse5))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1748) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647)))))))) is different from false [2022-12-13 22:18:49,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1746) .cse1 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1748) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740) (not (<= v_ArrVal_1738 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1746) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse6 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse4) 2147483647)))))))) is different from false [2022-12-13 22:18:49,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1746) .cse1 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1748) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1738) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1746) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse7 .cse1))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse5) 2147483647)))))))) is different from false [2022-12-13 22:18:49,457 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1737 Int) (v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (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_1737)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse5 v_ArrVal_1738) .cse4 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1746) .cse1 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1740) (< (+ (select .cse3 .cse5) 1) v_ArrVal_1738) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1746) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1748) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse7 .cse1)))))))))) is different from false [2022-12-13 22:19:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 22:19:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850454269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:19:09,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:19:09,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-12-13 22:19:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626484438] [2022-12-13 22:19:09,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:19:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 22:19:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:19:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 22:19:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1739, Unknown=79, NotChecked=582, Total=2862 [2022-12-13 22:19:10,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 22:19:10,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 631 transitions, 10230 flow. Second operand has 54 states, 54 states have (on average 177.33333333333334) internal successors, (9576), 54 states have internal predecessors, (9576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:19:10,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:19:10,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 22:19:10,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:19:22,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:24,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:32,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:35,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:38,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:40,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:19:45,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:20:17,572 WARN L233 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 163 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:20:22,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:20:31,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:20:53,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:20:59,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:21:14,998 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 280 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:21:17,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:21:19,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:21:51,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:21:53,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:21:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:21:57,725 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-12-13 22:21:59,734 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-12-13 22:22:01,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:22:03,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:22:05,769 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-12-13 22:22:05,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ (select .cse4 .cse5) 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse2))) (< .cse3 v_ArrVal_1748)))) (forall ((v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743))) (let ((.cse8 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1746) .cse2 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse1) 1) v_ArrVal_1746) (< .cse3 v_ArrVal_1740) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse8 .cse2))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1748) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647)))))))))) is different from false [2022-12-13 22:22:07,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:22:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:22,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:24,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:26,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse4 .cse5) 1)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse2))) (< .cse3 v_ArrVal_1748)))) (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1746) .cse5 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= v_ArrVal_1746 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse3 v_ArrVal_1748) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse6 .cse2))))))))) is different from false [2022-12-13 22:22:28,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:22:29,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= v_ArrVal_1748 .cse2)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse3)))))) (forall ((v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1740 Int) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743))) (let ((.cse8 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1746) .cse3 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse1) 1) v_ArrVal_1746) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse7 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse8 .cse3))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1748) (not (<= v_ArrVal_1740 .cse2)) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647))))))))) is different from false [2022-12-13 22:22:32,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:32,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1748 Int) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1748))))) (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse5 .cse2))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647)))))) is different from false [2022-12-13 22:22:36,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:40,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1748 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (v_ArrVal_1743 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1746 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1742))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| 4) |c_~#queue~0.offset|) v_ArrVal_1743))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1746) .cse1 v_ArrVal_1748)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1748) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_84| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1746) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse3) 2147483647))))))) (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1749) |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse6 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse3) 2147483647)))))) is different from false [2022-12-13 22:22:45,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:47,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:52,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:52,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse0 .cse2)))))) (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1750) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| 4) |c_~#queue~0.offset|) v_ArrVal_1751) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_83| (select .cse3 .cse2)))))))) is different from false [2022-12-13 22:22:54,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:56,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:22:58,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:00,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:02,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:04,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:06,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:08,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]