/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 02:49:12,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 02:49:12,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 02:49:12,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 02:49:12,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 02:49:12,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 02:49:12,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 02:49:12,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 02:49:12,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 02:49:12,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 02:49:12,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 02:49:12,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 02:49:12,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 02:49:12,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 02:49:12,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 02:49:12,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 02:49:12,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 02:49:12,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 02:49:12,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 02:49:12,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 02:49:12,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 02:49:12,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 02:49:12,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 02:49:12,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 02:49:12,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 02:49:12,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 02:49:12,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 02:49:12,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 02:49:12,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 02:49:12,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 02:49:12,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 02:49:12,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 02:49:12,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 02:49:12,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 02:49:12,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 02:49:12,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 02:49:12,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 02:49:12,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 02:49:12,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 02:49:12,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 02:49:12,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 02:49:12,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 02:49:12,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 02:49:12,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 02:49:12,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 02:49:12,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 02:49:12,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 02:49:12,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 02:49:12,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 02:49:12,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 02:49:12,687 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 02:49:12,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 02:49:12,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 02:49:12,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 02:49:12,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 02:49:12,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 02:49:12,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 02:49:12,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 02:49:12,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 02:49:12,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 02:49:12,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:49:12,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 02:49:12,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 02:49:12,692 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 02:49:12,692 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 02:49:12,692 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 02:49:12,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 02:49:12,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 02:49:12,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 02:49:12,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 02:49:12,918 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 02:49:12,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-11-16 02:49:12,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa74bda6/e5eedb5dd4f04d7bb94fabce3135a156/FLAGef22321c2 [2022-11-16 02:49:13,427 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 02:49:13,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-11-16 02:49:13,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa74bda6/e5eedb5dd4f04d7bb94fabce3135a156/FLAGef22321c2 [2022-11-16 02:49:13,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa74bda6/e5eedb5dd4f04d7bb94fabce3135a156 [2022-11-16 02:49:13,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 02:49:13,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 02:49:13,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 02:49:13,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 02:49:13,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 02:49:13,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:49:13" (1/1) ... [2022-11-16 02:49:13,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723a66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:13, skipping insertion in model container [2022-11-16 02:49:13,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:49:13" (1/1) ... [2022-11-16 02:49:13,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 02:49:13,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 02:49:14,197 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-16 02:49:14,202 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-16 02:49:14,204 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-16 02:49:14,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:49:14,220 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 02:49:14,274 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-16 02:49:14,282 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-16 02:49:14,285 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-16 02:49:14,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:49:14,332 INFO L208 MainTranslator]: Completed translation [2022-11-16 02:49:14,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14 WrapperNode [2022-11-16 02:49:14,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 02:49:14,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 02:49:14,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 02:49:14,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 02:49:14,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,382 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-11-16 02:49:14,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 02:49:14,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 02:49:14,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 02:49:14,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 02:49:14,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,413 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 02:49:14,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 02:49:14,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 02:49:14,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 02:49:14,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (1/1) ... [2022-11-16 02:49:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:49:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:49:14,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 02:49:14,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 02:49:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 02:49:14,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 02:49:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 02:49:14,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 02:49:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 02:49:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 02:49:14,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 02:49:14,492 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 02:49:14,610 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 02:49:14,611 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 02:49:14,967 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 02:49:14,976 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 02:49:14,976 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 02:49:14,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:49:14 BoogieIcfgContainer [2022-11-16 02:49:14,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 02:49:14,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 02:49:14,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 02:49:14,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 02:49:14,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:49:13" (1/3) ... [2022-11-16 02:49:14,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e3262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:49:14, skipping insertion in model container [2022-11-16 02:49:14,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:49:14" (2/3) ... [2022-11-16 02:49:14,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e3262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:49:14, skipping insertion in model container [2022-11-16 02:49:14,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:49:14" (3/3) ... [2022-11-16 02:49:14,986 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-16 02:49:14,993 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 02:49:15,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 02:49:15,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-16 02:49:15,002 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 02:49:15,128 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 02:49:15,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 02:49:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:49:15,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 02:49:15,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 02:49:15,231 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 02:49:15,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-16 02:49:15,252 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;@64397d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:15,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 02:49:15,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1072998195, now seen corresponding path program 1 times [2022-11-16 02:49:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:15,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991093384] [2022-11-16 02:49:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:15,814 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-16 02:49:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:15,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991093384] [2022-11-16 02:49:15,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991093384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:15,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:15,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 02:49:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363922461] [2022-11-16 02:49:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:15,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 02:49:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:15,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 02:49:15,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 02:49:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:15,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:15,847 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-16 02:49:15,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:15,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 02:49:15,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 205824109, now seen corresponding path program 1 times [2022-11-16 02:49:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757556611] [2022-11-16 02:49:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:16,129 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-16 02:49:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757556611] [2022-11-16 02:49:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757556611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:16,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 02:49:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354626162] [2022-11-16 02:49:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:16,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:49:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:49:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 02:49:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:16,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:16,134 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-16 02:49:16,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:16,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:16,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 02:49:16,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1012824832, now seen corresponding path program 1 times [2022-11-16 02:49:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:16,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679119034] [2022-11-16 02:49:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:17,939 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-16 02:49:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679119034] [2022-11-16 02:49:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679119034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:17,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 02:49:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701946920] [2022-11-16 02:49:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:17,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 02:49:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 02:49:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-16 02:49:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:17,951 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:17,951 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-16 02:49:17,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:17,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:17,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:18,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 02:49:18,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash 969017787, now seen corresponding path program 1 times [2022-11-16 02:49:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:18,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872163662] [2022-11-16 02:49:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:21,566 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-16 02:49:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872163662] [2022-11-16 02:49:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872163662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:21,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-16 02:49:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028587290] [2022-11-16 02:49:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 02:49:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 02:49:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-16 02:49:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:21,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:21,571 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-16 02:49:21,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:21,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:21,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:21,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:49:23,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 02:49:23,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1518472118, now seen corresponding path program 1 times [2022-11-16 02:49:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:23,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682875589] [2022-11-16 02:49:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:23,976 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-16 02:49:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:23,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682875589] [2022-11-16 02:49:23,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682875589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:23,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:23,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 02:49:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107918626] [2022-11-16 02:49:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:23,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:49:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:49:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 02:49:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:23,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:23,980 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-16 02:49:23,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:23,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:23,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:23,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:49:23,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:24,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 02:49:24,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash -133683344, now seen corresponding path program 1 times [2022-11-16 02:49:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:24,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091597562] [2022-11-16 02:49:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:28,265 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-16 02:49:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:28,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091597562] [2022-11-16 02:49:28,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091597562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:28,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:28,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-16 02:49:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383193582] [2022-11-16 02:49:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 02:49:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 02:49:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2022-11-16 02:49:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:28,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:28,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 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-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 02:49:30,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1940192969, now seen corresponding path program 1 times [2022-11-16 02:49:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400465668] [2022-11-16 02:49:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:30,733 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-16 02:49:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:30,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400465668] [2022-11-16 02:49:30,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400465668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:30,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:30,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 02:49:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574162806] [2022-11-16 02:49:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:30,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 02:49:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 02:49:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 02:49:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:30,740 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-16 02:49:30,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:30,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 02:49:30,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1194863548, now seen corresponding path program 2 times [2022-11-16 02:49:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:30,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954608510] [2022-11-16 02:49:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:33,417 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-16 02:49:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:33,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954608510] [2022-11-16 02:49:33,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954608510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:33,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:33,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-16 02:49:33,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529825994] [2022-11-16 02:49:33,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 02:49:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 02:49:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-16 02:49:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:33,420 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:33,420 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-16 02:49:33,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:33,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:33,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:33,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:33,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:36,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 02:49:36,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1817523668, now seen corresponding path program 1 times [2022-11-16 02:49:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:36,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399228617] [2022-11-16 02:49:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:37,027 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-16 02:49:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399228617] [2022-11-16 02:49:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399228617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:37,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:37,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 02:49:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021409131] [2022-11-16 02:49:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 02:49:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 02:49:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 02:49:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:37,032 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-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 02:49:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 02:49:37,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -587525970, now seen corresponding path program 1 times [2022-11-16 02:49:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:37,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849409996] [2022-11-16 02:49:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:37,924 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-16 02:49:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:37,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849409996] [2022-11-16 02:49:37,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849409996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:37,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:37,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 02:49:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540544154] [2022-11-16 02:49:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:37,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 02:49:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 02:49:37,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 02:49:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,928 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:37,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 02:49:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 02:49:38,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 02:49:38,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 02:49:38,268 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 02:49:38,270 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-16 02:49:38,275 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:38,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 02:49:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:49:38,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 02:49:38,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-16 02:49:38,289 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 02:49:38,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 02:49:38,289 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;@64397d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:38,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 02:49:38,292 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-16 02:49:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1751721974, now seen corresponding path program 1 times [2022-11-16 02:49:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605854112] [2022-11-16 02:49:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:38,309 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-16 02:49:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:38,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605854112] [2022-11-16 02:49:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605854112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:38,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:38,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 02:49:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892967993] [2022-11-16 02:49:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 02:49:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 02:49:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 02:49:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:38,311 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-16 02:49:38,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-16 02:49:38,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-16 02:49:38,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-16 02:49:38,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 02:49:38,548 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-16 02:49:38,548 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-16 02:49:38,551 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 02:49:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:49:38,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 02:49:38,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-16 02:49:38,601 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 02:49:38,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-16 02:49:38,602 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;@64397d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:49:38,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 02:49:38,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 928321693, now seen corresponding path program 1 times [2022-11-16 02:49:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:38,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853103108] [2022-11-16 02:49:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:38,706 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-16 02:49:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:38,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853103108] [2022-11-16 02:49:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853103108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:38,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:38,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 02:49:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336443767] [2022-11-16 02:49:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:38,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 02:49:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 02:49:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 02:49:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:38,708 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-16 02:49:38,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 02:49:38,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash 112962813, now seen corresponding path program 1 times [2022-11-16 02:49:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:38,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526241113] [2022-11-16 02:49:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:38,769 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-16 02:49:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:38,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526241113] [2022-11-16 02:49:38,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526241113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:38,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:38,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 02:49:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771748980] [2022-11-16 02:49:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:49:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:49:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 02:49:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:38,772 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-16 02:49:38,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:38,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 02:49:38,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1901618358, now seen corresponding path program 1 times [2022-11-16 02:49:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:38,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400284529] [2022-11-16 02:49:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:38,906 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-16 02:49:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:38,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400284529] [2022-11-16 02:49:38,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400284529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:38,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:38,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 02:49:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220963304] [2022-11-16 02:49:38,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 02:49:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:38,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 02:49:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 02:49:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:38,908 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-16 02:49:38,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:38,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:38,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 02:49:38,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -534059007, now seen corresponding path program 1 times [2022-11-16 02:49:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739010312] [2022-11-16 02:49:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:39,032 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-16 02:49:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:39,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739010312] [2022-11-16 02:49:39,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739010312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:39,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:39,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 02:49:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347186360] [2022-11-16 02:49:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:39,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:49:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:49:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 02:49:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:39,034 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-16 02:49:39,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:39,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 02:49:39,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1526931374, now seen corresponding path program 1 times [2022-11-16 02:49:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:39,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948679614] [2022-11-16 02:49:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:39,169 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-16 02:49:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:39,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948679614] [2022-11-16 02:49:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948679614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 02:49:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636341929] [2022-11-16 02:49:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:39,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 02:49:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 02:49:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 02:49:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:39,173 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-16 02:49:39,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:39,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:39,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 02:49:39,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 507940128, now seen corresponding path program 1 times [2022-11-16 02:49:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:39,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431630851] [2022-11-16 02:49:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:40,713 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-16 02:49:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:40,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431630851] [2022-11-16 02:49:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431630851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:40,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:40,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 02:49:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141195590] [2022-11-16 02:49:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:40,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 02:49:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 02:49:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-16 02:49:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:40,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:40,715 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-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:40,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:41,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 02:49:41,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2144984805, now seen corresponding path program 1 times [2022-11-16 02:49:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547547621] [2022-11-16 02:49:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:49,664 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-16 02:49:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547547621] [2022-11-16 02:49:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547547621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:49,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:49,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-16 02:49:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728091019] [2022-11-16 02:49:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:49,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 02:49:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 02:49:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 02:49:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:49,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:49,667 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-16 02:49:49,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:49,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:49:55,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 02:49:55,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1977224726, now seen corresponding path program 1 times [2022-11-16 02:49:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076596934] [2022-11-16 02:49:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:49:57,385 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-16 02:49:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:49:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076596934] [2022-11-16 02:49:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076596934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:49:57,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:49:57,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-16 02:49:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324320985] [2022-11-16 02:49:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:49:57,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 02:49:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:49:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 02:49:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-16 02:49:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:57,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:49:57,387 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-16 02:49:57,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:57,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:57,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:49:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:49:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:49:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 02:49:59,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:49:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:49:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1169226838, now seen corresponding path program 1 times [2022-11-16 02:49:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:49:59,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751590474] [2022-11-16 02:49:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:49:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:49:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:03,574 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-16 02:50:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:50:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751590474] [2022-11-16 02:50:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751590474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:50:03,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:50:03,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-16 02:50:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911734069] [2022-11-16 02:50:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:50:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 02:50:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:50:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 02:50:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 02:50:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:03,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:50:03,577 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-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:03,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:06,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 02:50:06,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:50:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:50:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2008994769, now seen corresponding path program 1 times [2022-11-16 02:50:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:50:06,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152773217] [2022-11-16 02:50:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:50:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:50:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:12,206 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-16 02:50:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:50:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152773217] [2022-11-16 02:50:12,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152773217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:50:12,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:50:12,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-11-16 02:50:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050067078] [2022-11-16 02:50:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:50:12,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 02:50:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:50:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 02:50:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2081, Unknown=0, NotChecked=0, Total=2256 [2022-11-16 02:50:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:12,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:50:12,209 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-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:12,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 02:50:20,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 02:50:20,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:50:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:50:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -100422824, now seen corresponding path program 1 times [2022-11-16 02:50:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:50:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859180887] [2022-11-16 02:50:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:50:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:20,407 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-16 02:50:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:50:20,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859180887] [2022-11-16 02:50:20,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859180887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:50:20,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057580074] [2022-11-16 02:50:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:50:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:50:20,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:50:20,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 02:50:20,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 02:50:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:20,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 02:50:20,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:50:20,809 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-16 02:50:20,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:50:20,975 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-16 02:50:20,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057580074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:50:20,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:50:20,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 02:50:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248121425] [2022-11-16 02:50:20,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:50:20,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 02:50:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:50:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 02:50:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 02:50:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:20,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:50:20,979 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-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 02:50:20,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 02:50:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:50:21,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 02:50:21,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:50:21,378 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:50:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:50:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 474472794, now seen corresponding path program 1 times [2022-11-16 02:50:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:50:21,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46819015] [2022-11-16 02:50:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:50:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:50:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:25,122 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-16 02:50:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:50:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46819015] [2022-11-16 02:50:25,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46819015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:50:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028745951] [2022-11-16 02:50:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:50:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:50:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:50:25,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 02:50:25,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 02:50:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:50:25,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 02:50:25,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:50:25,524 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 02:50:25,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 02:50:25,573 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 02:50:25,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 02:50:25,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 02:50:25,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 02:50:26,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-16 02:50:26,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:26,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:50:26,998 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 02:50:26,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-16 02:50:27,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:27,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:27,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 02:50:27,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2022-11-16 02:50:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:27,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 02:50:28,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 02:50:28,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:28,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:50:28,574 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 02:50:28,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 02:50:28,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:28,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:28,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-16 02:50:28,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2022-11-16 02:50:29,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:29,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 02:50:29,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:29,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:29,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-16 02:50:29,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-16 02:50:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:50:29,652 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 02:50:29,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-16 02:50:29,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:50:29,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 02:50:29,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 02:50:29,782 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-16 02:50:29,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:50:31,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 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_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 02:50:31,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 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_969) |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_975) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 02:50:31,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 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_969) |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_975) .cse1) 800))))) is different from false [2022-11-16 02:50:31,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_975 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_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 02:50:31,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_964 Int) (v_ArrVal_975 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_964)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |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_975) .cse1)))))) is different from false [2022-11-16 02:50:31,212 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_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_964 Int) (v_ArrVal_975 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_964))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |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_975) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse3)))))) is different from false [2022-11-16 02:50:33,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (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_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2022-11-16 02:50:33,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))))))))) is different from false [2022-11-16 02:50:33,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))))))))) is different from false [2022-11-16 02:50:34,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2022-11-16 02:50:34,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (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_956)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))))))))) is different from false [2022-11-16 02:50:34,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_956))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse8 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 (+ 3200 |c_~#queue~0.offset|)) (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse6 .cse3)))))))))))) is different from false [2022-11-16 02:50:34,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse9 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_956))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_958) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse8 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |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 .cse4))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse1) (select .cse5 (+ 3200 |c_~#queue~0.offset|))))))))))) is different from false [2022-11-16 02:50:34,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_954))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_956))) (store (store .cse10 .cse8 v_ArrVal_958) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse7 .cse8 v_ArrVal_965) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 (+ 3200 |c_~#queue~0.offset|)))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse1))))))))))) is different from false [2022-11-16 02:50:36,580 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-16 02:50:36,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1858 treesize of output 1426 [2022-11-16 02:50:36,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:50:36,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2979 treesize of output 2933 [2022-11-16 02:50:36,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1883 treesize of output 1787 [2022-11-16 02:50:36,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2158 treesize of output 2114 [2022-11-16 02:50:36,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2090 treesize of output 2018 [2022-11-16 02:50:36,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2175 treesize of output 2123 [2022-11-16 02:50:37,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 02:50:38,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:50:38,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 308 [2022-11-16 02:50:39,590 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-16 02:50:39,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2022-11-16 02:50:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-16 02:50:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028745951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:50:39,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:50:39,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 49] total 125 [2022-11-16 02:50:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136581783] [2022-11-16 02:50:39,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:50:39,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-16 02:50:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:50:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-16 02:50:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1098, Invalid=11021, Unknown=147, NotChecked=3234, Total=15500 [2022-11-16 02:50:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:39,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:50:39,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 5.752) internal successors, (719), 125 states have internal predecessors, (719), 0 states have call successors, (0), 0 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-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:50:39,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 02:50:39,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:50:39,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:51:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:51:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:51:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:51:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:51:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-16 02:51:00,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 02:51:00,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 02:51:00,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:51:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:51:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2120910101, now seen corresponding path program 1 times [2022-11-16 02:51:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:51:00,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377722646] [2022-11-16 02:51:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:51:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:51:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:51:06,429 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-16 02:51:06,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:51:06,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377722646] [2022-11-16 02:51:06,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377722646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:51:06,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778461756] [2022-11-16 02:51:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:51:06,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:51:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:51:06,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 02:51:06,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 02:51:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:51:06,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 174 conjunts are in the unsatisfiable core [2022-11-16 02:51:06,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:51:06,814 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 02:51:06,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 02:51:06,882 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 02:51:06,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 02:51:07,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 02:51:07,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 02:51:07,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-16 02:51:08,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:08,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:51:08,378 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 02:51:08,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-16 02:51:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:08,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:08,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 02:51:08,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2022-11-16 02:51:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:08,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 02:51:09,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 02:51:10,553 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-16 02:51:10,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 58 [2022-11-16 02:51:10,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:10,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:51:10,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:10,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:10,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:51:10,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:10,860 INFO L321 Elim1Store]: treesize reduction 57, result has 23.0 percent of original size [2022-11-16 02:51:10,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 86 [2022-11-16 02:51:11,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2022-11-16 02:51:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:11,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 02:51:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:12,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:12,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-16 02:51:12,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:12,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2022-11-16 02:51:13,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:13,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:13,534 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-16 02:51:13,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2022-11-16 02:51:13,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:13,721 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 55 [2022-11-16 02:51:14,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:14,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 02:51:14,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:14,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:14,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-11-16 02:51:14,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:14,970 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-16 02:51:14,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2022-11-16 02:51:15,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:51:15,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-16 02:51:15,340 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 02:51:15,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-16 02:51:15,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 02:51:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:51:15,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:51:15,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse0) 0))) (or (< 0 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|) (forall ((v_ArrVal_1150 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse0) 1)))))) is different from false [2022-11-16 02:51:28,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (let ((.cse8 (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_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse4 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (= 800 (select .cse2 .cse3)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)))))))) is different from false [2022-11-16 02:51:29,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1131) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse2 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse2 .cse4) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (= (select .cse3 .cse4) 800))))))) is different from false [2022-11-16 02:51:46,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse7 v_ArrVal_1131) .cse4 v_ArrVal_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse0 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse0 .cse4) 4)) v_ArrVal_1140))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select .cse2 |c_~#queue~0.base|) .cse1) 800)) (= 800 (select .cse3 .cse4))))))))) is different from false [2022-11-16 02:51:57,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse9 |c_~#queue~0.base| (store (store (store (select .cse9 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse7 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse0 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select .cse2 |c_~#queue~0.base|) .cse1) 800)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4)) 0))))))))) is different from false [2022-11-16 02:52:06,853 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:06,973 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|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:07,116 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|)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse9 v_ArrVal_1137) .cse2 v_ArrVal_1139) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1139) (= 800 (select .cse4 .cse5)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:07,220 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 ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse9 v_ArrVal_1137) .cse2 v_ArrVal_1139) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1139) (= 800 (select .cse4 .cse5)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:07,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1)))))))) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse11 .cse4) (select .cse11 .cse1))))) is different from false [2022-11-16 02:52:07,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)) v_ArrVal_1140))) (let ((.cse2 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse3) 0)) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (= (select .cse4 .cse5) (select .cse4 .cse1))) (= (select .cse7 .cse5) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select .cse2 |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2022-11-16 02:52:08,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (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_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse7 .cse10 v_ArrVal_1137) .cse4 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse1) 0)) (= (select .cse2 .cse3) 800) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse4) 800)) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse4) (select .cse5 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1139)))))))) is different from false [2022-11-16 02:52:09,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse6 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (= (select .cse5 .cse3) 800) (not (= 800 (select (select .cse6 |c_~#queue~0.base|) .cse1))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select (store .cse6 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0))))))))) is different from false [2022-11-16 02:52:09,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse2 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse5 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1140))) (let ((.cse4 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_1142) .cse2 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (= 800 (select (select .cse4 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (= (select .cse7 .cse2) 800)))))))) is different from false [2022-11-16 02:52:11,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse2 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse3) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse1))) (= (select .cse4 .cse5) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse1) (select .cse6 .cse5)))))))))) is different from false [2022-11-16 02:52:12,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (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_1120)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse1 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store (store (store .cse2 .cse10 v_ArrVal_1137) .cse3 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) v_ArrVal_1140))) (let ((.cse4 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse10 v_ArrVal_1142) .cse1 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (= 800 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1139) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse3) 800)) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse3) (select .cse5 .cse1))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0))))))))) is different from false [2022-11-16 02:52:12,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1120))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse2 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse7 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_1142) .cse2 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (= (select .cse4 .cse2) 800) (not (= (select (select (store .cse5 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1139) (not (= (select (select .cse5 |c_~#queue~0.base|) .cse1) 800))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse15 .cse14)))))) is different from false [2022-11-16 02:52:13,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse15 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1120))) (store (store .cse15 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1122) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse14 |c_~#queue~0.base| (store (store (store (select .cse14 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse12 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse6 .cse12 v_ArrVal_1137) .cse5 v_ArrVal_1139) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse4 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 .cse1))) (= 800 (select .cse2 .cse3)) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse5) 800)) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1139) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0)) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse3) (select .cse8 .cse5))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:14,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse14 .cse11 v_ArrVal_1122) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse4 .cse11 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse1))) (= (select .cse2 .cse3) 800) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1139) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse1) (select .cse5 .cse3))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse8 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 02:52:18,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1119))) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse15 .cse11 v_ArrVal_1122) .cse4 (+ (select .cse15 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse6 .cse11 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse2) 0)) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse4) (select .cse3 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse7 .cse4)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse8 .cse4)))))))))))) is different from false [2022-11-16 02:52:32,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1117)))) (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1119))) (let ((.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse17 .cse13 v_ArrVal_1122) .cse3 (+ (select .cse17 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse12 (let ((.cse14 (let ((.cse15 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse15 |c_~#queue~0.base| (store (store (store (select .cse15 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse13 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store (store (store .cse7 .cse13 v_ArrVal_1137) .cse4 v_ArrVal_1139) (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse13 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse1) 0)) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse4))) (= (select .cse6 .cse3) 800) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse4))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1139) (not (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse4) (select .cse8 .cse3)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse10 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))))) is different from false [2022-11-16 02:52:34,249 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-16 02:52:34,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 8748 treesize of output 5835 [2022-11-16 02:52:35,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:52:35,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75066 treesize of output 74142 [2022-11-16 02:52:35,764 INFO L173 IndexEqualityManager]: detected equality via solver Received shutdown request... [2022-11-16 02:57:55,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:57:55,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:57:55,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:57:55,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:57:55,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:57:56,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 02:57:56,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-11-16 02:57:56,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2022-11-16 02:57:56,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-11-16 02:57:57,120 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-16 02:57:57,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown