./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:47:05,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:47:05,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:47:05,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:47:05,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:47:05,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:47:05,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:47:05,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:47:05,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:47:05,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:47:05,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:47:05,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:47:05,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:47:05,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:47:05,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:47:05,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:47:05,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:47:05,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:47:05,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:47:05,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:47:05,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:47:05,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:47:05,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:47:05,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:47:05,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:47:05,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:47:05,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:47:05,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:47:05,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:47:05,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:47:05,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:47:05,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:47:05,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:47:05,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:47:05,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:47:05,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:47:05,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:47:05,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:47:05,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:47:05,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:47:05,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:47:05,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:47:05,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:47:05,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:47:05,346 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:47:05,346 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:47:05,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:47:05,347 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:47:05,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:47:05,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:47:05,349 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:47:05,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:47:05,350 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:47:05,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:47:05,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:47:05,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:47:05,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:47:05,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:47:05,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:47:05,352 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:47:05,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:47:05,352 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:47:05,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:47:05,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:47:05,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:47:05,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:47:05,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:47:05,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:47:05,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:47:05,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:47:05,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:47:05,355 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:47:05,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:47:05,356 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:47:05,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:47:05,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:47:05,357 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:47:05,357 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:47:05,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/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_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2022-11-25 18:47:05,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:47:05,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:47:05,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:47:05,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:47:05,694 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:47:05,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/pthread/queue_longest.i [2022-11-25 18:47:08,786 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:47:09,078 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:47:09,085 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i [2022-11-25 18:47:09,116 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/data/bad6c8dfe/8f819360fce049cebee42a666b94cef4/FLAG7a7849c5a [2022-11-25 18:47:09,130 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/data/bad6c8dfe/8f819360fce049cebee42a666b94cef4 [2022-11-25 18:47:09,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:47:09,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:47:09,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:47:09,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:47:09,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:47:09,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:47:09" (1/1) ... [2022-11-25 18:47:09,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a026775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:09, skipping insertion in model container [2022-11-25 18:47:09,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:47:09" (1/1) ... [2022-11-25 18:47:09,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:47:09,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:47:09,809 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-25 18:47:09,820 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-25 18:47:09,826 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-25 18:47:09,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:47:09,850 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:47:09,929 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-25 18:47:09,935 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-25 18:47:09,942 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_fd090b83-5dc9-4294-ab5b-394f754c5acd/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-25 18:47:09,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:47:10,030 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:47:10,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10 WrapperNode [2022-11-25 18:47:10,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:47:10,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:47:10,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:47:10,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:47:10,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,127 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-11-25 18:47:10,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:47:10,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:47:10,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:47:10,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:47:10,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,190 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:47:10,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:47:10,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:47:10,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:47:10,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (1/1) ... [2022-11-25 18:47:10,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:47:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:47:10,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:47:10,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:47:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:47:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:47:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:47:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:47:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:47:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:47:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:47:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:47:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:47:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:47:10,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:47:10,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:47:10,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:47:10,296 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:47:10,449 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:47:10,465 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:47:10,884 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:47:10,895 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:47:10,895 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:47:10,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:47:10 BoogieIcfgContainer [2022-11-25 18:47:10,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:47:10,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:47:10,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:47:10,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:47:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:47:09" (1/3) ... [2022-11-25 18:47:10,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c9f02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:47:10, skipping insertion in model container [2022-11-25 18:47:10,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:47:10" (2/3) ... [2022-11-25 18:47:10,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c9f02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:47:10, skipping insertion in model container [2022-11-25 18:47:10,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:47:10" (3/3) ... [2022-11-25 18:47:10,908 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-25 18:47:10,917 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:47:10,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:47:10,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-25 18:47:10,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:47:11,193 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:47:11,248 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:47:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:47:11,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:47:11,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:47:11,304 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:47:11,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-25 18:47:11,327 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=PARTIAL_ORDER_FA, 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;@36e7624f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:11,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:47:11,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -47954565, now seen corresponding path program 1 times [2022-11-25 18:47:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704596522] [2022-11-25 18:47:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:11,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704596522] [2022-11-25 18:47:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704596522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:11,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:47:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903434157] [2022-11-25 18:47:11,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:47:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:47:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:47:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:12,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:12,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:47:12,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:12,053 INFO L85 PathProgramCache]: Analyzing trace with hash -709610595, now seen corresponding path program 1 times [2022-11-25 18:47:12,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:12,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10835586] [2022-11-25 18:47:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:12,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10835586] [2022-11-25 18:47:12,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10835586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:12,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:12,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:47:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12671834] [2022-11-25 18:47:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:12,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:47:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:12,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:47:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:47:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,352 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:12,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:12,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:12,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:47:12,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2105464912, now seen corresponding path program 1 times [2022-11-25 18:47:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:12,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630207079] [2022-11-25 18:47:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630207079] [2022-11-25 18:47:14,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630207079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:14,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:14,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 18:47:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355084472] [2022-11-25 18:47:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:14,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:47:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:47:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:47:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:14,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:14,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.588235294117647) internal successors, (112), 17 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:14,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:14,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:15,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:47:15,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1705964395, now seen corresponding path program 1 times [2022-11-25 18:47:15,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:15,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069357694] [2022-11-25 18:47:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:19,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069357694] [2022-11-25 18:47:19,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069357694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:19,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:19,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-25 18:47:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715722119] [2022-11-25 18:47:19,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:19,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:47:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:19,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:47:19,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:47:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:19,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:19,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:19,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:19,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:19,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:19,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:47:22,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:47:22,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2059986046, now seen corresponding path program 1 times [2022-11-25 18:47:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:22,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19612600] [2022-11-25 18:47:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19612600] [2022-11-25 18:47:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19612600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:22,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:22,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:47:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781643386] [2022-11-25 18:47:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:22,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:47:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:47:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:47:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:22,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:22,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:22,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:22,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:47:22,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:47:22,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1952864859, now seen corresponding path program 1 times [2022-11-25 18:47:22,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:22,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428437468] [2022-11-25 18:47:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:27,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-11-25 18:47:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:27,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428437468] [2022-11-25 18:47:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428437468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:27,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:27,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-25 18:47:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765145197] [2022-11-25 18:47:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 18:47:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 18:47:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-11-25 18:47:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:27,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:27,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:47:31,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:47:31,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:31,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash -359424409, now seen corresponding path program 1 times [2022-11-25 18:47:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:31,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127996175] [2022-11-25 18:47:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:31,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:31,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127996175] [2022-11-25 18:47:31,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127996175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:31,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:31,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:47:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308793789] [2022-11-25 18:47:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:47:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:47:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:47:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:31,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:31,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:31,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:31,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:31,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:31,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:31,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:31,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:47:31,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:47:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:47:32,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash 10608120, now seen corresponding path program 1 times [2022-11-25 18:47:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481798579] [2022-11-25 18:47:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:32,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481798579] [2022-11-25 18:47:32,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481798579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:32,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:32,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:47:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891725186] [2022-11-25 18:47:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:32,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:47:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:47:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:47:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:32,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:32,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:32,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:32,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:47:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:47:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:33,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:47:33,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:47:33,131 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:47:33,133 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-25 18:47:33,139 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:33,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:47:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:47:33,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:47:33,185 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:47:33,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:47:33,186 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=PARTIAL_ORDER_FA, 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;@36e7624f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:33,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-25 18:47:33,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-25 18:47:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1441540613, now seen corresponding path program 1 times [2022-11-25 18:47:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:33,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441104394] [2022-11-25 18:47:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:33,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-25 18:47:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:33,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441104394] [2022-11-25 18:47:33,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441104394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:33,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:33,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:47:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948606311] [2022-11-25 18:47:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:33,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:47:33,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:47:33,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:47:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:33,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-25 18:47:33,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-25 18:47:33,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-25 18:47:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:47:33,544 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 18:47:33,545 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-25 18:47:33,549 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:47:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:47:33,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:47:33,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-25 18:47:33,561 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:47:33,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-25 18:47:33,562 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=PARTIAL_ORDER_FA, 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;@36e7624f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:47:33,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:47:33,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1137353387, now seen corresponding path program 1 times [2022-11-25 18:47:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:33,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056251341] [2022-11-25 18:47:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:33,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056251341] [2022-11-25 18:47:33,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056251341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:33,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:33,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:47:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191348640] [2022-11-25 18:47:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:47:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:47:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:47:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:33,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:47:33,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1327907785, now seen corresponding path program 1 times [2022-11-25 18:47:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:33,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076864393] [2022-11-25 18:47:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:33,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076864393] [2022-11-25 18:47:33,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076864393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:33,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:47:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700188710] [2022-11-25 18:47:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:33,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:47:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:47:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:47:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:33,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:33,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:33,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:47:33,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:33,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:33,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1263185258, now seen corresponding path program 1 times [2022-11-25 18:47:33,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:33,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643654790] [2022-11-25 18:47:33,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:33,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:33,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643654790] [2022-11-25 18:47:33,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643654790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:33,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:33,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:47:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987373903] [2022-11-25 18:47:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:47:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:47:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:47:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:33,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:33,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:33,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:33,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:47:34,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1485707984, now seen corresponding path program 1 times [2022-11-25 18:47:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:34,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702779494] [2022-11-25 18:47:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702779494] [2022-11-25 18:47:34,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702779494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:34,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:34,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:47:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541744937] [2022-11-25 18:47:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:47:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:47:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:47:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,130 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:34,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:34,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:47:34,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -871296707, now seen corresponding path program 1 times [2022-11-25 18:47:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:34,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359944076] [2022-11-25 18:47:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:34,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359944076] [2022-11-25 18:47:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359944076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:34,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:47:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91104282] [2022-11-25 18:47:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:34,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:47:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:34,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:47:34,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:47:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:34,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:34,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:34,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:47:34,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1301773904, now seen corresponding path program 1 times [2022-11-25 18:47:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:34,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651858012] [2022-11-25 18:47:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:36,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:36,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651858012] [2022-11-25 18:47:36,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651858012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:36,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:36,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 18:47:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992872265] [2022-11-25 18:47:36,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:36,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:47:36,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:47:36,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:47:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:36,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:36,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:36,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:36,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:36,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:36,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:36,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:36,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:36,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:47:36,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1151899979, now seen corresponding path program 1 times [2022-11-25 18:47:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:36,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635787274] [2022-11-25 18:47:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635787274] [2022-11-25 18:47:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635787274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:48,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:48,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-25 18:47:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51717611] [2022-11-25 18:47:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 18:47:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 18:47:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 18:47:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:48,809 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:48,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2105263157894735) internal successors, (198), 38 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:48,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:47:56,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:47:56,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:47:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash -956101306, now seen corresponding path program 1 times [2022-11-25 18:47:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:56,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698330440] [2022-11-25 18:47:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698330440] [2022-11-25 18:47:59,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698330440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:47:59,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:47:59,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-25 18:47:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054000665] [2022-11-25 18:47:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:47:59,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 18:47:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 18:47:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-25 18:47:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:59,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:59,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.733333333333333) internal successors, (202), 30 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:47:59,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:47:59,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:47:59,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:48:02,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:48:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1764099194, now seen corresponding path program 1 times [2022-11-25 18:48:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630754748] [2022-11-25 18:48:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:48:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630754748] [2022-11-25 18:48:08,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630754748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:08,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:08,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-25 18:48:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267130139] [2022-11-25 18:48:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:08,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 18:48:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 18:48:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 18:48:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:08,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:08,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.611111111111111) internal successors, (202), 36 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:08,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:08,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:48:12,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:48:12,958 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:48:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 15915521, now seen corresponding path program 1 times [2022-11-25 18:48:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:12,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045664125] [2022-11-25 18:48:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:48:25,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:25,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045664125] [2022-11-25 18:48:25,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045664125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:25,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:25,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-11-25 18:48:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718902160] [2022-11-25 18:48:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:25,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:48:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:48:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2421, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 18:48:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:25,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:25,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:48:25,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:25,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:25,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:48:25,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:48:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:48:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:48:38,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:48:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1027195559, now seen corresponding path program 1 times [2022-11-25 18:48:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727953157] [2022-11-25 18:48:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:48:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727953157] [2022-11-25 18:48:38,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727953157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:48:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339901703] [2022-11-25 18:48:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:38,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:38,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:38,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:48:38,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:48:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:38,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:48:38,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:48:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:48:38,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:48:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:48:39,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339901703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:48:39,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:48:39,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 18:48:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819490631] [2022-11-25 18:48:39,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:48:39,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:48:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:48:39,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:48:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:39,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:39,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:48:39,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:39,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:39,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:39,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:48:39,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:48:39,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:48:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:48:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:48:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:48:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:39,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:48:39,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:39,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:48:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2006130598, now seen corresponding path program 1 times [2022-11-25 18:48:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423117944] [2022-11-25 18:48:39,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:49:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:49:08,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:49:08,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423117944] [2022-11-25 18:49:08,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423117944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:49:08,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210611201] [2022-11-25 18:49:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:49:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:49:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:49:08,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:49:08,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:49:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:49:08,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-25 18:49:08,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:49:08,545 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:49:08,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:49:08,665 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:49:08,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:49:09,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:49:09,190 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 23 treesize of output 22 [2022-11-25 18:49:10,352 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 31 treesize of output 29 [2022-11-25 18:49:11,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:11,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:49:11,219 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:49:11,219 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 49 treesize of output 39 [2022-11-25 18:49:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:11,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:11,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 18:49:12,015 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 46 treesize of output 27 [2022-11-25 18:49:12,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:12,291 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 33 treesize of output 31 [2022-11-25 18:49:13,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-25 18:49:13,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:13,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:49:13,892 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:49:13,892 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 51 treesize of output 41 [2022-11-25 18:49:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:14,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-25 18:49:14,542 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 48 treesize of output 29 [2022-11-25 18:49:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:14,768 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 33 treesize of output 31 [2022-11-25 18:49:15,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:15,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:15,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-25 18:49:15,543 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 40 treesize of output 27 [2022-11-25 18:49:16,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:49:16,060 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:49:16,061 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 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 18:49:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:16,164 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 21 treesize of output 20 [2022-11-25 18:49:16,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:49:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:49:16,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:49:18,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-25 18:49:18,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-25 18:49:18,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800))))) is different from false [2022-11-25 18:49:18,493 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-25 18:49:18,569 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-25 18:49:18,627 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_908)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800))))) is different from false [2022-11-25 18:49:18,690 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse3)))))) is different from false [2022-11-25 18:49:18,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_909) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))))))) is different from false [2022-11-25 18:49:19,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))))) is different from false [2022-11-25 18:49:21,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))))))))) is different from false [2022-11-25 18:49:21,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))))))))) is different from false [2022-11-25 18:49:21,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800)) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (= (select .cse2 (+ 3200 |c_~#queue~0.offset|)) (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse1))))))))) is different from false [2022-11-25 18:49:22,391 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_902 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_902) .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))))))))) (= 800 .cse9)))) is different from false [2022-11-25 18:49:22,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_902 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_900 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_900)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse8 .cse9))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_902) .cse9 (+ 1 .cse5))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse7 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (= 800 .cse5))))))))) is different from false [2022-11-25 18:49:22,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_902 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_900 Int)) (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_900))) (let ((.cse7 (select .cse10 .cse1))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_902) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse9 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse3) (select .cse5 (+ 3200 |c_~#queue~0.offset|)))) (= .cse7 800)))))))))))) is different from false [2022-11-25 18:49:22,757 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_902 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_900 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse10 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_900)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select .cse10 .cse6))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_902) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse9 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800)) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (= (select .cse2 (+ 3200 |c_~#queue~0.offset|)) (select .cse2 .cse1))) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse7 .cse1)))))))))))) is different from false [2022-11-25 18:49:22,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_902 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_900 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse10 .cse1))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_902) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse8 .cse9 v_ArrVal_909) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse1))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse1) (select .cse5 (+ 3200 |c_~#queue~0.offset|))))))))))))) is different from false [2022-11-25 18:49:23,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_902 Int) (v_ArrVal_900 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_898))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_902) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse8 .cse9 v_ArrVal_909) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 (+ 3200 |c_~#queue~0.offset|)))) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse6 .cse1))) (not (= (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800)))))))))))) is different from false [2022-11-25 18:49:25,730 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_902 Int) (v_ArrVal_900 Int) (v_ArrVal_897 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_897)))) (let ((.cse13 (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_898))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse14 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse14 .cse1))) (let ((.cse5 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_902) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_905))) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse11 .cse12 v_ArrVal_909) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4))) (= .cse6 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse7 .cse1))) (not (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse1) (select .cse8 .cse4)))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 800))))))))))))) is different from false [2022-11-25 18:49:25,883 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-25 18:49:25,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 3 new quantified variables, introduced 5 case distinctions, treesize of input 2608 treesize of output 2065 [2022-11-25 18:49:26,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:26,015 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 2931 treesize of output 2855 [2022-11-25 18:49:26,056 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 1249 treesize of output 1185 [2022-11-25 18:49:26,104 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 1457 treesize of output 1409 [2022-11-25 18:49:26,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1574 treesize of output 1534 [2022-11-25 18:49:26,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1626 treesize of output 1590 [2022-11-25 18:49:26,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-25 18:49:29,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:29,066 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 742 treesize of output 644 [2022-11-25 18:49:30,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:30,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-25 18:49:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-25 18:49:31,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210611201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:49:31,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:49:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 43, 51] total 126 [2022-11-25 18:49:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656407868] [2022-11-25 18:49:31,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:49:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-11-25 18:49:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:49:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-11-25 18:49:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=10240, Unknown=65, NotChecked=4332, Total=15750 [2022-11-25 18:49:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:31,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:49:31,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 5.666666666666667) internal successors, (714), 126 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:49:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:49:31,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:49:31,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:49:31,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:49:31,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:49:31,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:04,483 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 277 DAG size of output: 219 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:50:18,358 WARN L233 SmtUtils]: Spent 7.45s on a formula simplification. DAG size of input: 270 DAG size of output: 217 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:50:26,169 WARN L233 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 264 DAG size of output: 220 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:50:34,275 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 259 DAG size of output: 221 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:00,467 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 286 DAG size of output: 250 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:16,305 WARN L233 SmtUtils]: Spent 11.45s on a formula simplification. DAG size of input: 288 DAG size of output: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:51:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:51:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:51:28,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:28,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 18:51:28,985 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:51:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1441538975, now seen corresponding path program 1 times [2022-11-25 18:51:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:28,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778607262] [2022-11-25 18:51:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778607262] [2022-11-25 18:51:37,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778607262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658793553] [2022-11-25 18:51:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:37,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:37,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:51:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:37,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-25 18:51:37,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:38,155 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:51:38,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:51:38,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:51:38,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:51:38,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:51:38,775 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 23 treesize of output 22 [2022-11-25 18:51:39,802 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 31 treesize of output 29 [2022-11-25 18:51:40,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:40,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:51:40,691 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:51:40,691 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 49 treesize of output 39 [2022-11-25 18:51:40,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:40,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 18:51:41,461 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 46 treesize of output 27 [2022-11-25 18:51:41,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:41,767 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 33 treesize of output 31 [2022-11-25 18:51:42,777 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 33 treesize of output 31 [2022-11-25 18:51:43,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:51:43,754 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:51:43,755 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 51 treesize of output 41 [2022-11-25 18:51:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:43,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:43,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-25 18:51:44,786 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 51 treesize of output 32 [2022-11-25 18:51:45,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:45,028 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-11-25 18:51:45,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:45,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:45,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:51:46,340 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 40 treesize of output 27 [2022-11-25 18:51:47,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:47,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:51:47,602 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:51:47,602 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-11-25 18:51:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:47,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:47,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:51:47,989 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 32 treesize of output 25 [2022-11-25 18:51:48,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:48,159 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 16 treesize of output 18 [2022-11-25 18:51:48,582 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 23 treesize of output 22 [2022-11-25 18:51:48,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:51:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:48,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:49,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2022-11-25 18:51:53,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 800)) (not (<= v_ArrVal_1077 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))))) is different from false [2022-11-25 18:51:53,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 800)) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1077))))) is different from false [2022-11-25 18:51:53,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (not (= (let ((.cse6 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6)) 800))))))) is different from false [2022-11-25 18:51:53,337 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (not (= (let ((.cse6 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6)) 800))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-11-25 18:51:53,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse2))) (not (= (let ((.cse5 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse1 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085)) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5)) 800)))))) (= 800 .cse0)))) is different from false [2022-11-25 18:51:53,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse7 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (let ((.cse3 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (let ((.cse2 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 v_ArrVal_1079) .cse3 (+ (select .cse1 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse2 v_ArrVal_1085)) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3)))) (< (+ .cse5 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse4))))))) (= 800 .cse5)))) is different from false [2022-11-25 18:51:53,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1072)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse7 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse6 .cse7)) (.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_1077) (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse2))) (not (= 800 (let ((.cse5 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse1 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085)) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5))))))))) is different from false [2022-11-25 18:51:53,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse8 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse8 .cse1)) (.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse4))) (< (+ 1 .cse2) v_ArrVal_1077) (not (= 800 (let ((.cse7 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse6 v_ArrVal_1079) .cse7 (+ (select .cse3 .cse7) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse6 v_ArrVal_1085)) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse7)))))))))))) is different from false [2022-11-25 18:51:53,667 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse8 .cse1)) (.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (= .cse2 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse4))) (< (+ .cse2 1) v_ArrVal_1077) (not (= 800 (let ((.cse7 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse6 v_ArrVal_1079) .cse7 (+ (select .cse3 .cse7) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse6 v_ArrVal_1085)) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse7)))))))))) is different from false [2022-11-25 18:51:57,069 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1074) .cse5 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse7 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1077) (= 800 .cse0) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse2 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085) .cse5 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse5))))))))))) is different from false [2022-11-25 18:51:57,118 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1074) .cse5 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse7 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1077) (= 800 .cse0) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse2 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085) .cse5 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse5))))))))))) is different from false [2022-11-25 18:51:57,166 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ 3200 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1074) .cse6 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse8 .cse6)) (.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_1077) (= 800 .cse1) (not (= (let ((.cse5 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse3 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085) .cse6 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse6))))))))))) is different from false [2022-11-25 18:51:57,211 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3204)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1074) .cse6 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse8 .cse6)) (.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_1077) (= 800 .cse1) (not (= (let ((.cse5 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse3 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085) .cse6 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse6))))))))))) is different from false [2022-11-25 18:51:57,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse1 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1074) .cse5 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse7 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1077) (= 800 .cse0) (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse2 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085) .cse5 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse5)))))))))) (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse9 .cse5) (select .cse9 .cse4))))) is different from false [2022-11-25 18:51:58,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse6 (select .cse9 .cse1)) (.cse4 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse5 .cse1))) (= .cse6 800) (< (+ .cse6 1) v_ArrVal_1077) (not (= 800 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store (store .cse4 .cse8 v_ArrVal_1079) .cse2 (+ (select .cse4 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse8 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse2))))))))))) is different from false [2022-11-25 18:51:58,320 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse0 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5))) (= .cse6 800) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse1) (select .cse7 .cse5))) (< (+ .cse6 1) v_ArrVal_1077))))))))) is different from false [2022-11-25 18:51:58,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1074) .cse5 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse5))) (or (= .cse0 800) (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse2 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085) .cse5 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse5))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse5) (select .cse7 .cse4))) (< (+ .cse0 1) v_ArrVal_1077))))))))) is different from false [2022-11-25 18:51:58,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1074) .cse2 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse9 .cse2)) (.cse6 (select .cse5 |c_~#queue~0.base|))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (= .cse4 800) (not (= 800 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse6 .cse7 v_ArrVal_1079) .cse1 (+ (select .cse6 .cse1) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse7 v_ArrVal_1085) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse8 .cse2))) (< (+ .cse4 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse2))))))))))) is different from false [2022-11-25 18:51:58,974 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1065)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1074) .cse4 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse8 (select .cse9 .cse4))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_1079) .cse3 (+ (select .cse1 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse2 v_ArrVal_1085) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse5 .cse4))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse4) (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse4))) (= 800 .cse8) (< (+ .cse8 1) v_ArrVal_1077))))))))) is different from false [2022-11-25 18:51:59,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1065))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1074) .cse2 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse4 |c_~#queue~0.base|)) (.cse8 (select .cse9 .cse2))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse6 v_ArrVal_1079) .cse1 (+ (select .cse5 .cse1) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse6 v_ArrVal_1085) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse2))) (= .cse8 800) (< (+ .cse8 1) v_ArrVal_1077))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse13 .cse12)))))) is different from false [2022-11-25 18:51:59,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1065))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1066) .cse10 (+ (select .cse13 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (select .cse11 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (= 800 .cse2) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4))) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse7 .cse8 v_ArrVal_1079) .cse4 (+ (select .cse7 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse8 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse9 .cse10))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse7 .cse1))) (< (+ .cse2 1) v_ArrVal_1077)))))))))) is different from false [2022-11-25 18:52:05,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1061)))) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1063))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse15 .cse8 v_ArrVal_1066) .cse2 (+ (select .cse15 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse6 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_1074) .cse2 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse9 (select .cse12 .cse2))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 .cse2) (select .cse4 .cse1))) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse7 .cse8 v_ArrVal_1079) .cse1 (+ 1 (select .cse7 .cse1))) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse8 v_ArrVal_1085) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse1))) (= 800 .cse9) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse10 .cse2))) (< (+ .cse9 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse11 .cse2)))))))))))))) is different from false [2022-11-25 18:52:05,883 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-25 18:52:05,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 3 new quantified variables, introduced 5 case distinctions, treesize of input 1922 treesize of output 1358 [2022-11-25 18:52:05,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:05,959 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 2736 treesize of output 2700 [2022-11-25 18:52:06,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1833 treesize of output 1793 [2022-11-25 18:52:06,063 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 1297 treesize of output 1233 [2022-11-25 18:52:06,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1440 treesize of output 1376 [2022-11-25 18:52:06,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1855 treesize of output 1791 [2022-11-25 18:52:06,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1934 treesize of output 1886 [2022-11-25 18:52:07,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-25 18:52:26,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:26,233 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 10717 treesize of output 9275 [2022-11-25 18:52:28,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:28,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-25 18:52:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-11-25 18:52:29,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658793553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:29,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:29,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 48, 59] total 147 [2022-11-25 18:52:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918816670] [2022-11-25 18:52:29,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:29,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2022-11-25 18:52:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2022-11-25 18:52:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=13806, Unknown=156, NotChecked=6118, Total=21462 [2022-11-25 18:52:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:29,397 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 5.428571428571429) internal successors, (798), 147 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:29,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:52:29,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:12,506 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 218 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:20,126 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 229 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:27,508 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 231 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:58,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:54:00,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:55:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:55:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:55:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-25 18:55:00,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:55:00,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 18:55:00,893 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:55:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 810210652, now seen corresponding path program 1 times [2022-11-25 18:55:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:00,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5397131] [2022-11-25 18:55:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5397131] [2022-11-25 18:55:14,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5397131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851802332] [2022-11-25 18:55:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:14,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:14,969 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:14,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd090b83-5dc9-4294-ab5b-394f754c5acd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:55:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:15,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 221 conjunts are in the unsatisfiable core [2022-11-25 18:55:15,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:15,673 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:55:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:55:15,822 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:55:15,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:55:16,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:55:16,555 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 23 treesize of output 22 [2022-11-25 18:55:18,279 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 36 [2022-11-25 18:55:19,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:19,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:19,577 INFO L321 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-11-25 18:55:19,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 51 [2022-11-25 18:55:20,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:20,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:20,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:20,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-11-25 18:55:21,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-25 18:55:21,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:21,539 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 34 treesize of output 32 [2022-11-25 18:55:23,190 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 34 treesize of output 32 [2022-11-25 18:55:25,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:25,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:25,393 INFO L321 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-11-25 18:55:25,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 51 [2022-11-25 18:55:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:26,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:26,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:26,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:26,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:26,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:55:27,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:55:28,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:28,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-25 18:55:30,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:30,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:30,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:30,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:30,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 18:55:32,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:32,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 18:55:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:35,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:35,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:35,213 INFO L321 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2022-11-25 18:55:35,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2022-11-25 18:55:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:36,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:36,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:36,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:36,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:36,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 18:55:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:37,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 18:55:37,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:37,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:37,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-11-25 18:55:39,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:39,689 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 54 treesize of output 44 [2022-11-25 18:55:39,709 INFO L321 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-11-25 18:55:39,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 30 [2022-11-25 18:55:40,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:40,008 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 16 treesize of output 18 [2022-11-25 18:55:40,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:55:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:40,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:41,169 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_1263 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1))))))) is different from false [2022-11-25 18:55:43,810 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse4 |c_~#stored_elements~0.base|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1261 Int)) (let ((.cse2 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1261)))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1261 Int)) (let ((.cse7 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1261)))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0))) (= (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (select .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) 0))))))) is different from false [2022-11-25 18:55:53,126 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse9 .cse8) 4)))) (and (forall ((v_ArrVal_1261 Int) (v_ArrVal_1255 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 .cse10 v_ArrVal_1255))) (store (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)) .cse8 (+ 1 (select .cse6 .cse8))))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1255 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (store .cse9 .cse10 v_ArrVal_1255))) (store (store .cse14 .cse7 (+ (select .cse14 .cse7) 1)) .cse8 (+ 1 (select .cse14 .cse8))))))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (select .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1))))))))) is different from false [2022-11-25 18:59:11,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse1 (+ (select .cse16 .cse1) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse3) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0))))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (select .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse3) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1))))))))) is different from false [2022-11-25 18:59:12,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse4 (+ (select .cse16 .cse4) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0))))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (= (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (select .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0))))))))) is different from false [2022-11-25 18:59:12,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse4 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse1 (+ (select .cse16 .cse1) 1))) (.cse11 (+ (* 4 (select .cse16 .cse9)) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse3) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0))))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse3) (not (= (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))) is different from false [2022-11-25 18:59:13,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1)))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse4 (+ (select .cse16 .cse4) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (= (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) is different from false [2022-11-25 18:59:32,730 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse20 (select .cse18 .cse19))) (or (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse19 (+ .cse20 1))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse4 (+ (select .cse16 .cse4) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse1 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse0) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse0) (not (= (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (= 800 .cse20)))) is different from false [2022-11-25 18:59:33,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse20 (select .cse18 .cse19))) (or (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1)) .cse19 (+ .cse20 1))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse4 (+ (select .cse16 .cse4) 1))) (.cse11 (+ (* 4 (select .cse16 .cse9)) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (= (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (= 800 .cse20)))) is different from false [2022-11-25 18:59:52,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse22 .cse20) 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse21 (select .cse18 .cse20))) (or (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (let ((.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) .cse20 (+ 1 .cse21))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse1 (+ (select .cse16 .cse1) 1))) (.cse11 (+ |c_~#queue~0.offset| (* (select .cse16 .cse9) 4)))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= 1 (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse4)))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (= (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (select .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse4) (not (= 0 (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3)))))))))) (= 800 .cse21))))) is different from false [2022-11-25 18:59:53,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse22 .cse20) 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse21 (select .cse18 .cse20))) (or (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (let ((.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) .cse20 (+ .cse21 1))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse4 (+ (select .cse16 .cse4) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (not (= 1 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1))) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ (select .cse15 .cse8) 1)) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (= (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (select .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse2) (not (= 0 (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1)))))))))) (= 800 .cse21))))) is different from false [2022-11-25 18:59:53,568 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse18 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse22 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse22 .cse20))) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse21 (select .cse18 .cse20))) (or (let ((.cse6 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (let ((.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) .cse20 (+ .cse21 1))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 .cse8 (+ (- 1) (select .cse16 .cse8))) .cse2 (+ (select .cse16 .cse2) 1))) (.cse11 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse3 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse7 .cse8 (+ 1 (select .cse7 .cse8))) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse0) (not (= (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1))))) (forall ((v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_1255 Int) (v_ArrVal_1263 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store .cse6 |c_~#queue~0.base| (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1255))) (store (store .cse15 .cse8 (+ 1 (select .cse15 .cse8))) .cse9 (+ (select .cse15 .cse9) 1)))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_30| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1261))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_30| .cse0) (= (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (select .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|))) 0) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0))))))))) (= .cse21 800))))) is different from false