./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 b09c85b7 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U --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-b09c85b [2022-11-08 07:42:45,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-08 07:42:45,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-08 07:42:45,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-08 07:42:45,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-08 07:42:45,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-08 07:42:45,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-08 07:42:45,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-08 07:42:45,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-08 07:42:45,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-08 07:42:45,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-08 07:42:45,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-08 07:42:45,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-08 07:42:45,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-08 07:42:45,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-08 07:42:45,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-08 07:42:45,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-08 07:42:45,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-08 07:42:45,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-08 07:42:45,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-08 07:42:45,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-08 07:42:45,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-08 07:42:45,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-08 07:42:45,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-08 07:42:45,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-08 07:42:45,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-08 07:42:45,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-08 07:42:45,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-08 07:42:45,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-08 07:42:45,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-08 07:42:45,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-08 07:42:45,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-08 07:42:45,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-08 07:42:45,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-08 07:42:45,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-08 07:42:45,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-08 07:42:45,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-08 07:42:45,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-08 07:42:45,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-08 07:42:45,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-08 07:42:45,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-08 07:42:45,148 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-08 07:42:45,185 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-08 07:42:45,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-08 07:42:45,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-08 07:42:45,190 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-08 07:42:45,191 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-08 07:42:45,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-08 07:42:45,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-08 07:42:45,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-08 07:42:45,193 INFO L138 SettingsManager]: * Use SBE=true [2022-11-08 07:42:45,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-08 07:42:45,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-08 07:42:45,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-08 07:42:45,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-08 07:42:45,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-08 07:42:45,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-08 07:42:45,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-08 07:42:45,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-08 07:42:45,196 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-08 07:42:45,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-08 07:42:45,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-08 07:42:45,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-08 07:42:45,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-08 07:42:45,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-08 07:42:45,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-08 07:42:45,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-08 07:42:45,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-08 07:42:45,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-08 07:42:45,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-08 07:42:45,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-08 07:42:45,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-08 07:42:45,200 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-08 07:42:45,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-08 07:42:45,200 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-08 07:42:45,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-08 07:42:45,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-08 07:42:45,201 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-08 07:42:45,201 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-08 07:42:45,201 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_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/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_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U 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-08 07:42:45,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-08 07:42:45,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-08 07:42:45,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-08 07:42:45,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-08 07:42:45,568 INFO L275 PluginConnector]: CDTParser initialized [2022-11-08 07:42:45,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/../../sv-benchmarks/c/pthread/queue_longest.i [2022-11-08 07:42:45,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/data/4ce2a376f/4d5dc71174cf4845b79e4227c1dc7259/FLAGd9e1f59e5 [2022-11-08 07:42:46,269 INFO L306 CDTParser]: Found 1 translation units. [2022-11-08 07:42:46,270 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i [2022-11-08 07:42:46,288 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/data/4ce2a376f/4d5dc71174cf4845b79e4227c1dc7259/FLAGd9e1f59e5 [2022-11-08 07:42:46,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/data/4ce2a376f/4d5dc71174cf4845b79e4227c1dc7259 [2022-11-08 07:42:46,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-08 07:42:46,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-08 07:42:46,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-08 07:42:46,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-08 07:42:46,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-08 07:42:46,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:42:46" (1/1) ... [2022-11-08 07:42:46,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32978c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:46, skipping insertion in model container [2022-11-08 07:42:46,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:42:46" (1/1) ... [2022-11-08 07:42:46,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-08 07:42:46,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-08 07:42:47,161 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-08 07:42:47,167 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-08 07:42:47,170 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-08 07:42:47,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-08 07:42:47,186 INFO L203 MainTranslator]: Completed pre-run [2022-11-08 07:42:47,226 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-08 07:42:47,228 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-08 07:42:47,232 WARN L230 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_940fcd82-90a8-4469-a8e5-7866c565b005/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-08 07:42:47,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-08 07:42:47,286 INFO L208 MainTranslator]: Completed translation [2022-11-08 07:42:47,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47 WrapperNode [2022-11-08 07:42:47,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-08 07:42:47,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-08 07:42:47,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-08 07:42:47,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-08 07:42:47,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,353 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-11-08 07:42:47,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-08 07:42:47,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-08 07:42:47,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-08 07:42:47,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-08 07:42:47,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,386 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-08 07:42:47,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-08 07:42:47,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-08 07:42:47,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-08 07:42:47,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (1/1) ... [2022-11-08 07:42:47,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-08 07:42:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:47,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:47,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-08 07:42:47,489 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-08 07:42:47,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-08 07:42:47,489 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-08 07:42:47,490 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-08 07:42:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-08 07:42:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-08 07:42:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-08 07:42:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-08 07:42:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-08 07:42:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-08 07:42:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-08 07:42:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-08 07:42:47,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-08 07:42:47,493 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-08 07:42:47,748 INFO L235 CfgBuilder]: Building ICFG [2022-11-08 07:42:47,750 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-08 07:42:48,180 INFO L276 CfgBuilder]: Performing block encoding [2022-11-08 07:42:48,191 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-08 07:42:48,191 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-08 07:42:48,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:42:48 BoogieIcfgContainer [2022-11-08 07:42:48,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-08 07:42:48,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-08 07:42:48,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-08 07:42:48,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-08 07:42:48,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:42:46" (1/3) ... [2022-11-08 07:42:48,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3be26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:42:48, skipping insertion in model container [2022-11-08 07:42:48,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:47" (2/3) ... [2022-11-08 07:42:48,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3be26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:42:48, skipping insertion in model container [2022-11-08 07:42:48,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:42:48" (3/3) ... [2022-11-08 07:42:48,204 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-08 07:42:48,219 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-08 07:42:48,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-08 07:42:48,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-08 07:42:48,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-08 07:42:48,409 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-08 07:42:48,464 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:42:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:48,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:48,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-08 07:42:48,538 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:42:48,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-08 07:42:48,572 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;@51837016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:48,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-08 07:42:48,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 205077742, now seen corresponding path program 1 times [2022-11-08 07:42:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:48,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293394496] [2022-11-08 07:42:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:49,234 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-08 07:42:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:49,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293394496] [2022-11-08 07:42:49,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293394496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:49,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:49,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:42:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762384601] [2022-11-08 07:42:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:49,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:42:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:49,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:42:49,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:42:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:49,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-08 07:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-08 07:42:49,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2013468752, now seen corresponding path program 1 times [2022-11-08 07:42:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:49,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243280860] [2022-11-08 07:42:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:49,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:49,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243280860] [2022-11-08 07:42:49,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243280860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:49,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:49,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:42:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629948660] [2022-11-08 07:42:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:49,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:42:49,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:42:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:42:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:49,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08 07:42:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:49,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-08 07:42:49,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -703749757, now seen corresponding path program 1 times [2022-11-08 07:42:49,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794802883] [2022-11-08 07:42:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:52,376 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-08 07:42:52,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:52,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794802883] [2022-11-08 07:42:52,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794802883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:52,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:52,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-08 07:42:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791725049] [2022-11-08 07:42:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:52,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-08 07:42:52,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:52,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-08 07:42:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-08 07:42:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:52,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:52,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 07:42:52,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:52,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:52,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:53,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-08 07:42:53,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -940168002, now seen corresponding path program 1 times [2022-11-08 07:42:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95176352] [2022-11-08 07:42:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:57,932 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-08 07:42:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:57,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95176352] [2022-11-08 07:42:57,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95176352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:57,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:57,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-08 07:42:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687714783] [2022-11-08 07:42:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-08 07:42:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-08 07:42:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-08 07:42:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:57,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:57,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-08 07:42:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-08 07:43:00,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-08 07:43:00,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash 764148819, now seen corresponding path program 1 times [2022-11-08 07:43:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:00,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508931175] [2022-11-08 07:43:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:00,573 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-08 07:43:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:00,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508931175] [2022-11-08 07:43:00,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508931175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:00,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:00,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:43:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083640583] [2022-11-08 07:43:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:00,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:43:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:43:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:43:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:00,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-08 07:43:00,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:00,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-08 07:43:00,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-08 07:43:00,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1965528174, now seen corresponding path program 1 times [2022-11-08 07:43:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385845555] [2022-11-08 07:43:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:05,643 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-08 07:43:05,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:05,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385845555] [2022-11-08 07:43:05,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385845555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:05,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:05,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-08 07:43:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934689626] [2022-11-08 07:43:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:05,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-08 07:43:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-08 07:43:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-11-08 07:43:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:05,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:05,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-08 07:43:05,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:05,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:05,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:05,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:05,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:05,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:43:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-08 07:43:10,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1154321913, now seen corresponding path program 1 times [2022-11-08 07:43:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:10,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136043270] [2022-11-08 07:43:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:10,288 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-08 07:43:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136043270] [2022-11-08 07:43:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136043270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:10,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:10,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:43:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669817484] [2022-11-08 07:43:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:10,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:43:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:43:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:43:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:10,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:43:10,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:43:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-08 07:43:11,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 634770346, now seen corresponding path program 1 times [2022-11-08 07:43:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:11,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977648525] [2022-11-08 07:43:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:11,271 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-08 07:43:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:11,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977648525] [2022-11-08 07:43:11,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977648525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:11,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:11,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:43:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236581972] [2022-11-08 07:43:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:11,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:43:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:43:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:43:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:11,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-08 07:43:11,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:43:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:43:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-08 07:43:11,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-08 07:43:11,458 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-08 07:43:11,460 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-08 07:43:11,466 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:43:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:43:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:43:11,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:43:11,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-08 07:43:11,478 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:43:11,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-08 07:43:11,482 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;@51837016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:43:11,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-08 07:43:11,485 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-08 07:43:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 860146292, now seen corresponding path program 1 times [2022-11-08 07:43:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745023612] [2022-11-08 07:43:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:11,507 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-08 07:43:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:11,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745023612] [2022-11-08 07:43:11,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745023612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:11,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:11,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:43:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996011097] [2022-11-08 07:43:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:43:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:43:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:43:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:11,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-08 07:43:11,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-08 07:43:11,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-08 07:43:11,816 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-08 07:43:11,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-08 07:43:11,818 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-08 07:43:11,818 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-08 07:43:11,822 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:43:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:43:11,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:43:11,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:43:11,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-08 07:43:11,858 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:43:11,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-08 07:43:11,860 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;@51837016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:43:11,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-08 07:43:11,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -173963075, now seen corresponding path program 1 times [2022-11-08 07:43:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:11,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490171840] [2022-11-08 07:43:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:11,988 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-08 07:43:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490171840] [2022-11-08 07:43:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490171840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:11,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:11,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:43:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992491798] [2022-11-08 07:43:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:11,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:43:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:43:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:43:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-08 07:43:11,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-08 07:43:12,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 727937339, now seen corresponding path program 1 times [2022-11-08 07:43:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:12,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177501293] [2022-11-08 07:43:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:12,109 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-08 07:43:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:12,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177501293] [2022-11-08 07:43:12,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177501293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:12,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:12,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:43:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202813425] [2022-11-08 07:43:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:12,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:43:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:12,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:43:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:43:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,112 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:12,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-08 07:43:12,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-08 07:43:12,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1170927032, now seen corresponding path program 1 times [2022-11-08 07:43:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:12,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097624746] [2022-11-08 07:43:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:12,288 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-08 07:43:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:12,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097624746] [2022-11-08 07:43:12,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097624746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:12,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:12,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:43:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842590340] [2022-11-08 07:43:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:12,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:43:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:43:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:43:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:12,291 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-08 07:43:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-08 07:43:12,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1178061083, now seen corresponding path program 1 times [2022-11-08 07:43:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:12,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750617284] [2022-11-08 07:43:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:12,445 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-08 07:43:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750617284] [2022-11-08 07:43:12,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750617284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:12,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:12,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:43:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650194994] [2022-11-08 07:43:12,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:12,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:43:12,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:43:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:43:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,448 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 07:43:12,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-08 07:43:12,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -829906736, now seen corresponding path program 1 times [2022-11-08 07:43:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:12,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938702509] [2022-11-08 07:43:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:12,596 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-08 07:43:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:12,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938702509] [2022-11-08 07:43:12,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938702509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:12,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:43:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886123481] [2022-11-08 07:43:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:12,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:43:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:43:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:43:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:12,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 07:43:12,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:12,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-08 07:43:12,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:12,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1157481246, now seen corresponding path program 1 times [2022-11-08 07:43:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:12,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300727361] [2022-11-08 07:43:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:14,380 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-08 07:43:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:14,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300727361] [2022-11-08 07:43:14,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300727361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:14,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:14,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-08 07:43:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671868051] [2022-11-08 07:43:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:14,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-08 07:43:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-08 07:43:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-08 07:43:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:14,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:14,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-08 07:43:14,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:14,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:14,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:14,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:14,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:14,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:15,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-08 07:43:15,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1682884771, now seen corresponding path program 1 times [2022-11-08 07:43:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:15,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522932430] [2022-11-08 07:43:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:27,764 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-08 07:43:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:27,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522932430] [2022-11-08 07:43:27,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522932430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:27,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-08 07:43:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516228284] [2022-11-08 07:43:27,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:27,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-08 07:43:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:27,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-08 07:43:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2022-11-08 07:43:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:27,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2631578947368425) internal successors, (200), 38 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-08 07:43:27,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:27,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:27,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:27,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:27,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:27,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:27,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:43:35,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-08 07:43:35,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 227291992, now seen corresponding path program 1 times [2022-11-08 07:43:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:35,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833799080] [2022-11-08 07:43:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:38,860 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-08 07:43:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:38,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833799080] [2022-11-08 07:43:38,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833799080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:38,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:38,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-08 07:43:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184180049] [2022-11-08 07:43:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:38,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-08 07:43:38,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-08 07:43:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-08 07:43:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:38,864 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:38,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-08 07:43:38,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:38,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:38,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:38,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:38,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:38,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:38,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:43:38,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:43:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:41,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-08 07:43:41,597 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -580705896, now seen corresponding path program 1 times [2022-11-08 07:43:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641529196] [2022-11-08 07:43:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:48,451 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-08 07:43:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:48,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641529196] [2022-11-08 07:43:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641529196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:48,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:48,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-08 07:43:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747157555] [2022-11-08 07:43:48,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:48,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-08 07:43:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-08 07:43:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2022-11-08 07:43:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:48,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:48,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.666666666666667) internal successors, (204), 36 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-08 07:43:48,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:48,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:43:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:52,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-08 07:43:52,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash -210204653, now seen corresponding path program 1 times [2022-11-08 07:43:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:52,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912171109] [2022-11-08 07:43:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:00,988 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-08 07:44:00,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:44:00,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912171109] [2022-11-08 07:44:00,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912171109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:44:00,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:44:00,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-11-08 07:44:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86133462] [2022-11-08 07:44:00,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:44:00,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-08 07:44:00,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:44:00,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-08 07:44:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2022-11-08 07:44:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:00,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:44:00,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-08 07:44:00,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:00,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:00,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:00,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:44:13,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-08 07:44:13,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:44:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:44:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1785824410, now seen corresponding path program 1 times [2022-11-08 07:44:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:44:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078248013] [2022-11-08 07:44:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:44:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:13,427 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-08 07:44:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:44:13,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078248013] [2022-11-08 07:44:13,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078248013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:44:13,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840349848] [2022-11-08 07:44:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:44:13,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:44:13,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-08 07:44:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:13,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-08 07:44:13,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:44:13,869 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-08 07:44:13,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:44:14,034 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-08 07:44:14,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840349848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:44:14,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:44:14,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-08 07:44:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655255002] [2022-11-08 07:44:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:44:14,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-08 07:44:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:44:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-08 07:44:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-08 07:44:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:14,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:44:14,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.2) internal successors, (402), 10 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-08 07:44:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:44:14,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:44:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:44:14,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-08 07:44:14,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:14,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:44:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:44:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash -523280424, now seen corresponding path program 1 times [2022-11-08 07:44:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:44:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505387429] [2022-11-08 07:44:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:44:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:19,637 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-08 07:44:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:44:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505387429] [2022-11-08 07:44:19,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505387429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:44:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168017766] [2022-11-08 07:44:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:44:19,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:44:19,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-08 07:44:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:19,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-08 07:44:19,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:44:20,087 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:44:20,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:20,152 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:44:20,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:20,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:20,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:20,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:21,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:21,471 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-08 07:44:21,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-11-08 07:44:21,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:21,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:21,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-08 07:44:22,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:22,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:22,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:22,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:23,010 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-08 07:44:23,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-11-08 07:44:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:23,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:23,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-08 07:44:23,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:23,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:23,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:23,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:24,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:24,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:24,450 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-08 07:44:24,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:24,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:24,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:24,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:24,589 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-08 07:44:24,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:44:26,148 WARN L833 $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-08 07:44:26,247 WARN L833 $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-08 07:44:26,265 WARN L833 $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-08 07:44:26,282 WARN L833 $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-08 07:44:26,362 WARN L833 $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-08 07:44:26,429 WARN L833 $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-08 07:44:26,493 WARN L833 $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-08 07:44:26,543 WARN L833 $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-08 07:44:27,528 WARN L833 $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_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |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 (+ (select .cse4 .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 (= (select (store .cse2 (+ (* 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 .cse2 .cse1)))))))) is different from false [2022-11-08 07:44:27,688 WARN L833 $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 (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) |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 (+ (select .cse4 .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)))))))) is different from false [2022-11-08 07:44:27,713 WARN L833 $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 (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) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |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 (+ (select .cse4 .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))) (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-08 07:44:27,740 WARN L833 $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 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905) |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 (+ (select .cse4 .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)))))))) is different from false [2022-11-08 07:44:31,527 WARN L833 $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 ((.cse7 (store (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)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_898))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900))) (store (store .cse8 .cse6 v_ArrVal_902) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse5 .cse6 v_ArrVal_909) .cse1 (+ (select .cse5 .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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (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-08 07:44:31,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:31,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 825 treesize of output 515 [2022-11-08 07:44:31,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:31,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1365 treesize of output 1355 [2022-11-08 07:44:31,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:31,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:31,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1446 treesize of output 1430 [2022-11-08 07:44:31,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1468 treesize of output 1444 [2022-11-08 07:44:31,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-08 07:44:32,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:32,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 241 treesize of output 229 [2022-11-08 07:44:33,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:33,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:34,359 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-08 07:44:34,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168017766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:44:34,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:44:34,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 39] total 106 [2022-11-08 07:44:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891117601] [2022-11-08 07:44:34,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:44:34,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-11-08 07:44:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:44:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-11-08 07:44:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=7732, Unknown=90, NotChecked=2522, Total=11130 [2022-11-08 07:44:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:34,370 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:44:34,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 6.754716981132075) internal successors, (716), 106 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:44:34,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:34,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:34,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:44:34,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:44:34,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:44:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:44:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:44:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-08 07:44:47,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-08 07:44:47,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-08 07:44:47,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:44:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:44:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1645046637, now seen corresponding path program 1 times [2022-11-08 07:44:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:44:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537148549] [2022-11-08 07:44:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:44:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:55,525 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-08 07:44:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:44:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537148549] [2022-11-08 07:44:55,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537148549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:44:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922716238] [2022-11-08 07:44:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:55,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:44:55,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:44:55,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-08 07:44:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:55,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-08 07:44:55,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:44:55,978 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:44:55,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:56,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:44:56,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:56,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:56,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:57,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:58,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:58,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:58,188 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:44:58,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:58,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:58,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:58,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:58,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:59,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:59,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:44:59,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:00,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:45:00,597 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:45:00,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:00,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:00,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:01,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:01,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:01,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:02,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:02,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:02,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:02,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:03,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:03,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:45:03,294 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:45:03,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:03,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:03,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:03,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:03,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:03,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:45:03,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:04,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:04,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:04,233 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-08 07:45:04,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:45:08,076 WARN L833 $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-08 07:45:08,102 WARN L833 $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-08 07:45:08,127 WARN L833 $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-08 07:45:08,237 WARN L833 $PredicateComparison]: unable to prove that (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 ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse6 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)))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse4)))))))) is different from false [2022-11-08 07:45:08,330 WARN L833 $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 ((.cse0 (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)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 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 .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 (= 800 (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))))))))) is different from false [2022-11-08 07:45:08,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (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 ((.cse2 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse3 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1077) (not (= 800 (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 .cse0 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse0 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse3)))))) is different from false [2022-11-08 07:45:08,454 WARN L833 $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 ((.cse4 (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 .cse4 (+ 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 .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 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 .cse2 .cse6 v_ArrVal_1079) .cse7 (+ (select .cse2 .cse7) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse6 v_ArrVal_1085)) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse7)))))))))) is different from false [2022-11-08 07:45:16,196 WARN L833 $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_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 ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |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 ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (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) .cse1 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 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse1)))))))))) is different from false [2022-11-08 07:45:17,042 WARN L833 $PredicateComparison]: unable to prove that (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 ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |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 ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (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) .cse1 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 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse1)))))))))) (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)))) is different from false [2022-11-08 07:45:17,344 WARN L833 $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 ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_1074) .cse2 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1077) (not (= (let ((.cse6 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store (store .cse4 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse4 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085) .cse2 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse2))))))))))) is different from false [2022-11-08 07:45:17,835 WARN L833 $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 ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (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 .cse0 .cse7 v_ArrVal_1079) .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse7 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4))) (< (+ 1 (select .cse8 .cse1)) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:18,632 WARN L833 $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 ((.cse7 (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 ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (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 .cse9 |c_~#queue~0.base| (store (store .cse8 .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|))) (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))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse1) (select .cse6 .cse5))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:18,674 WARN L833 $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 ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (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 .cse9 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1074) .cse4 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (not (= 800 (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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse4))) (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))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:18,903 WARN L833 $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 ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse3 |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)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .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|))) (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))) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse2))))))))))) is different from false [2022-11-08 07:45:19,090 WARN L833 $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 ((.cse10 (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)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (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 .cse9 |c_~#queue~0.base| (store (store .cse8 .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|))) (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))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:19,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| 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_39| (select .cse0 .cse1))) (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 ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1065))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_1074) .cse4 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|))) (or (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse4))) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse7 .cse8 v_ArrVal_1079) .cse3 (+ (select .cse7 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse8 v_ArrVal_1085) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse9 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse7 .cse4))) (< (+ (select .cse10 .cse4) 1) v_ArrVal_1077)))))))))))) is different from false [2022-11-08 07:45:19,292 WARN L833 $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 ((.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse12 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1065))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1066) .cse9 (+ (select .cse12 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (not (= 800 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse6 .cse7 v_ArrVal_1079) .cse3 (+ (select .cse6 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse7 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse8 .cse9))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse1))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_1077)))))))))) is different from false [2022-11-08 07:45:23,893 WARN L833 $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 ((.cse13 (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)) (.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse14 .cse8 v_ArrVal_1066) .cse2 (+ (select .cse14 .cse2) 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 ((.cse11 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .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|))) (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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse9 .cse2))) (< (+ (select .cse10 .cse2) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse11 .cse2)))))))))))))) is different from false [2022-11-08 07:45:24,031 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-08 07:45:24,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1809 treesize of output 1290 [2022-11-08 07:45:24,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:24,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2491 treesize of output 2459 [2022-11-08 07:45:24,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1716 treesize of output 1680 [2022-11-08 07:45:24,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:24,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:24,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1581 treesize of output 1533 [2022-11-08 07:45:24,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1656 treesize of output 1616 [2022-11-08 07:45:25,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:25,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2022-11-08 07:45:29,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:29,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2037 treesize of output 1803 [2022-11-08 07:45:30,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:30,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:45:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-08 07:45:30,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922716238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:45:30,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:45:30,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47, 57] total 144 [2022-11-08 07:45:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357878452] [2022-11-08 07:45:30,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:45:30,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-11-08 07:45:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:45:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-11-08 07:45:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1421, Invalid=14243, Unknown=158, NotChecked=4770, Total=20592 [2022-11-08 07:45:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:30,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:45:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 5.555555555555555) internal successors, (800), 144 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-08 07:45:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:46:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:46:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-08 07:46:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:46:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:46:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-08 07:46:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:46:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-08 07:46:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-08 07:46:00,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-08 07:46:00,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-08 07:46:00,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:46:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:46:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash 684721550, now seen corresponding path program 1 times [2022-11-08 07:46:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:46:00,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126917411] [2022-11-08 07:46:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:46:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:46:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:46:46,498 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-08 07:46:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:46:46,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126917411] [2022-11-08 07:46:46,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126917411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:46:46,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375497047] [2022-11-08 07:46:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:46:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:46:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:46:46,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:46:46,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_940fcd82-90a8-4469-a8e5-7866c565b005/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-08 07:46:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:46:46,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 183 conjunts are in the unsatisfiable core [2022-11-08 07:46:46,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:46:47,397 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:46:47,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:47,573 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:46:47,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:48,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:48,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:49,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:51,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:46:51,273 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:46:51,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:52,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:53,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:53,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:54,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:46:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:56,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:46:56,394 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-08 07:46:56,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2022-11-08 07:46:56,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:56,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:56,879 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-08 07:46:56,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2022-11-08 07:46:57,838 INFO L356 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2022-11-08 07:46:57,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 44 [2022-11-08 07:46:58,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-08 07:47:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:00,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:00,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:00,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 55 [2022-11-08 07:47:01,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:01,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-08 07:47:04,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:47:04,493 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-11-08 07:47:04,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 60 [2022-11-08 07:47:04,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:04,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 55 [2022-11-08 07:47:05,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:05,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2022-11-08 07:47:05,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:05,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 43 [2022-11-08 07:47:06,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:06,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 34 [2022-11-08 07:47:07,000 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-08 07:47:07,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 24 [2022-11-08 07:47:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:07,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:47:07,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-08 07:47:07,809 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-08 07:47:07,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:47:08,735 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0))) (and (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))))) (or (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))) (not .cse0)))) is different from false [2022-11-08 07:47:10,772 WARN L833 $PredicateComparison]: unable to prove that (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))) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1261 Int) (v_ArrVal_1259 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1259)))) (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 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0)))) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1259 Int)) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1259)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (select .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse9 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)))))))) is different from false [2022-11-08 07:47:55,358 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) (+ |c_t2Thread1of1ForFork1_dequeue_#t~mem47#1| 1))))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse8 (+ |c_~#queue~0.offset| (* (select .cse7 .cse10) 4))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1261 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse0 (let ((.cse4 (store .cse6 |c_~#queue~0.base| (store (store (store .cse7 .cse8 v_ArrVal_1255) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259)))) (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) 1))) (not (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse12 (let ((.cse13 (store .cse6 |c_~#queue~0.base| (store (store (store .cse7 .cse8 v_ArrVal_1255) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (select .cse11 (+ (* 4 (select .cse11 .cse3)) |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) 0)))))))))) is different from false [2022-11-08 07:54:02,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse23 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse23 .cse14))) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse0 (let ((.cse4 (let ((.cse6 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse7 .cse3) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (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_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse19 |c_~#queue~0.base| (store (store (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store (store (store .cse20 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse20 .cse3) 1)) (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse16 (select .cse17 |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse17 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1)))))))))) is different from false [2022-11-08 07:56:04,142 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-08 07:56:08,011 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse0 (let ((.cse4 (let ((.cse6 (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1)))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse7 .cse3) 1)) (+ (* 4 (select .cse7 .cse9)) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (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) 1))) (not (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1)))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse19 .cse3) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0))))))))) is different from false [2022-11-08 07:56:09,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse24)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse24)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse13 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 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) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* 4 (select .cse23 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse22 .cse9) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse19 .cse1) 1)) (+ (* (select .cse19 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)))) 0)))))))) is different from false [2022-11-08 07:56:10,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 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) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))))) 0))))))) is different from false [2022-11-08 07:56:12,637 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 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) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))))) 0)))))))) is different from false [2022-11-08 07:56:13,163 WARN L833 $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|))) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 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) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))))) 0)))))))) is different from false [2022-11-08 07:56:13,574 WARN L833 $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|)))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse3 (let ((.cse5 (let ((.cse7 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse10))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse13 .cse10) 1))))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse7 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse8 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (= (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* 4 (select .cse23 .cse10))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse22 .cse10) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse19 .cse2) 1)) (+ (* (select .cse19 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1))) (not (= (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse2))))) 0)))))))) is different from false [2022-11-08 07:56:14,956 WARN L833 $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)))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse3 (let ((.cse5 (let ((.cse7 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse10))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse13 .cse10) 1))))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse7 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse8 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (= (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* 4 (select .cse23 .cse10))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse22 .cse10) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse19 .cse2) 1)) (+ (* (select .cse19 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1))) (not (= (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse2))))) 0)))))))) is different from false [2022-11-08 07:56:15,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 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) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))))) 0))))))) (let ((.cse23 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse23 .cse9) (select .cse23 .cse1))))) is different from false