/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 08:18:06,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 08:18:06,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 08:18:06,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 08:18:06,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 08:18:06,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 08:18:06,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 08:18:06,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 08:18:06,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 08:18:06,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 08:18:06,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 08:18:06,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 08:18:06,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 08:18:06,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 08:18:06,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 08:18:06,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 08:18:06,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 08:18:06,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 08:18:06,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 08:18:06,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 08:18:06,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 08:18:06,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 08:18:06,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 08:18:06,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 08:18:06,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 08:18:06,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 08:18:06,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 08:18:06,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 08:18:06,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 08:18:06,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 08:18:06,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 08:18:06,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 08:18:06,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 08:18:06,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 08:18:06,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 08:18:06,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 08:18:06,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 08:18:06,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 08:18:06,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 08:18:06,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 08:18:06,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 08:18:06,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2022-01-18 08:18:06,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 08:18:06,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 08:18:06,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 08:18:06,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 08:18:06,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 08:18:06,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 08:18:06,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 08:18:06,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 08:18:06,544 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 08:18:06,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 08:18:06,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 08:18:06,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 08:18:06,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 08:18:06,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 08:18:06,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 08:18:06,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 08:18:06,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 08:18:06,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 08:18:06,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 08:18:06,548 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 08:18:06,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 08:18:06,548 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 08:18:06,548 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 [2022-01-18 08:18:06,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 08:18:06,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 08:18:06,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 08:18:06,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 08:18:06,751 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 08:18:06,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-01-18 08:18:06,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41619994a/0588f3ec7e0d43239acb05a321871b88/FLAG49d980b8d [2022-01-18 08:18:07,260 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 08:18:07,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-01-18 08:18:07,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41619994a/0588f3ec7e0d43239acb05a321871b88/FLAG49d980b8d [2022-01-18 08:18:07,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41619994a/0588f3ec7e0d43239acb05a321871b88 [2022-01-18 08:18:07,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 08:18:07,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 08:18:07,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 08:18:07,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 08:18:07,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 08:18:07,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbe2c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07, skipping insertion in model container [2022-01-18 08:18:07,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 08:18:07,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 08:18:07,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-01-18 08:18:07,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-01-18 08:18:07,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 08:18:07,738 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 08:18:07,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-01-18 08:18:07,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-01-18 08:18:07,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 08:18:07,816 INFO L208 MainTranslator]: Completed translation [2022-01-18 08:18:07,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07 WrapperNode [2022-01-18 08:18:07,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 08:18:07,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 08:18:07,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 08:18:07,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 08:18:07,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,862 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-01-18 08:18:07,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 08:18:07,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 08:18:07,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 08:18:07,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 08:18:07,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 08:18:07,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 08:18:07,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 08:18:07,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 08:18:07,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (1/1) ... [2022-01-18 08:18:07,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 08:18:07,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:07,929 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-01-18 08:18:07,931 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-01-18 08:18:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-18 08:18:07,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-18 08:18:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-18 08:18:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-18 08:18:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 08:18:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 08:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 08:18:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 08:18:07,960 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 08:18:08,077 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 08:18:08,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 08:18:08,346 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 08:18:08,354 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 08:18:08,354 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-18 08:18:08,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 08:18:08 BoogieIcfgContainer [2022-01-18 08:18:08,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 08:18:08,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 08:18:08,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 08:18:08,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 08:18:08,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 08:18:07" (1/3) ... [2022-01-18 08:18:08,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385842f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 08:18:08, skipping insertion in model container [2022-01-18 08:18:08,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:18:07" (2/3) ... [2022-01-18 08:18:08,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385842f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 08:18:08, skipping insertion in model container [2022-01-18 08:18:08,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 08:18:08" (3/3) ... [2022-01-18 08:18:08,365 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-01-18 08:18:08,370 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 08:18:08,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 08:18:08,371 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 08:18:08,371 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 08:18:08,441 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,441 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,442 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,443 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,443 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,443 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,444 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,444 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,444 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,444 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,448 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,448 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,449 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,451 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,456 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,456 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,456 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,456 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,457 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,458 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,459 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,460 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,461 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,462 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,463 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,466 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,485 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,485 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,485 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,485 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,485 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,486 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,486 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,486 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,487 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,487 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,488 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,490 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,490 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,490 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,491 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,491 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,491 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,491 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,493 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,493 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,494 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,495 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,495 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,495 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,498 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,498 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,498 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,498 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,498 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,499 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,499 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,499 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,500 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,500 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,500 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,500 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,501 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,502 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,506 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,507 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,507 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,507 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,513 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,513 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,513 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,513 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,514 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,515 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,516 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,517 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,518 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,518 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,518 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,518 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,518 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,519 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,519 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,521 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,521 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,521 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,521 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,522 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,523 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,524 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,525 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,526 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,527 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,528 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,529 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,530 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,531 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,531 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,531 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,531 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,531 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,533 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,534 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,535 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,536 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,537 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,538 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,538 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,538 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,538 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,539 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,540 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,541 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,541 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,541 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,542 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,542 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,542 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,542 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,542 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,543 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,544 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,544 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,544 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,547 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,548 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,549 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,549 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,556 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:18:08,569 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 08:18:08,618 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 08:18:08,626 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 08:18:08,626 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 08:18:08,642 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 225 places, 231 transitions, 478 flow [2022-01-18 08:18:09,101 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-18 08:18:09,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:09,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:09,221 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-01-18 08:18:09,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:09,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725472307] [2022-01-18 08:18:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:09,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:09,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:09,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725472307] [2022-01-18 08:18:09,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725472307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:09,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:09,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 08:18:09,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723442466] [2022-01-18 08:18:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:09,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 08:18:09,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:09,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 08:18:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 08:18:09,535 INFO L87 Difference]: Start difference. First operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:09,732 INFO L93 Difference]: Finished difference Result 14373 states and 40204 transitions. [2022-01-18 08:18:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 08:18:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-01-18 08:18:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:09,898 INFO L225 Difference]: With dead ends: 14373 [2022-01-18 08:18:09,898 INFO L226 Difference]: Without dead ends: 14373 [2022-01-18 08:18:09,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 08:18:09,904 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:09,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:18:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2022-01-18 08:18:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14373. [2022-01-18 08:18:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14373 states, 14372 states have (on average 2.7973838018369053) internal successors, (40204), 14372 states have internal predecessors, (40204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 40204 transitions. [2022-01-18 08:18:10,460 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 40204 transitions. Word has length 58 [2022-01-18 08:18:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:10,462 INFO L470 AbstractCegarLoop]: Abstraction has 14373 states and 40204 transitions. [2022-01-18 08:18:10,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 40204 transitions. [2022-01-18 08:18:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-18 08:18:10,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:10,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:10,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 08:18:10,496 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-01-18 08:18:10,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:10,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870005138] [2022-01-18 08:18:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:10,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:11,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:11,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870005138] [2022-01-18 08:18:11,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870005138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:11,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:11,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 08:18:11,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410857150] [2022-01-18 08:18:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:11,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 08:18:11,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 08:18:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-18 08:18:11,022 INFO L87 Difference]: Start difference. First operand 14373 states and 40204 transitions. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:11,554 INFO L93 Difference]: Finished difference Result 14370 states and 40200 transitions. [2022-01-18 08:18:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 08:18:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-01-18 08:18:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:11,608 INFO L225 Difference]: With dead ends: 14370 [2022-01-18 08:18:11,608 INFO L226 Difference]: Without dead ends: 14370 [2022-01-18 08:18:11,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-01-18 08:18:11,610 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 563 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:11,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1055 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 08:18:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14370 states. [2022-01-18 08:18:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14370 to 14370. [2022-01-18 08:18:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14370 states, 14369 states have (on average 2.79768947038764) internal successors, (40200), 14369 states have internal predecessors, (40200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14370 states to 14370 states and 40200 transitions. [2022-01-18 08:18:12,117 INFO L78 Accepts]: Start accepts. Automaton has 14370 states and 40200 transitions. Word has length 120 [2022-01-18 08:18:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:12,119 INFO L470 AbstractCegarLoop]: Abstraction has 14370 states and 40200 transitions. [2022-01-18 08:18:12,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14370 states and 40200 transitions. [2022-01-18 08:18:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 08:18:12,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:12,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:12,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 08:18:12,141 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-01-18 08:18:12,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:12,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318959053] [2022-01-18 08:18:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:12,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:12,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318959053] [2022-01-18 08:18:12,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318959053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:12,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:12,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 08:18:12,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458401067] [2022-01-18 08:18:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:12,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 08:18:12,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 08:18:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:12,262 INFO L87 Difference]: Start difference. First operand 14370 states and 40200 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:12,286 INFO L93 Difference]: Finished difference Result 2713 states and 6565 transitions. [2022-01-18 08:18:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 08:18:12,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-18 08:18:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:12,294 INFO L225 Difference]: With dead ends: 2713 [2022-01-18 08:18:12,294 INFO L226 Difference]: Without dead ends: 2594 [2022-01-18 08:18:12,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:12,298 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:12,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:18:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-01-18 08:18:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594. [2022-01-18 08:18:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 2.42421905129194) internal successors, (6286), 2593 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 6286 transitions. [2022-01-18 08:18:12,353 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 6286 transitions. Word has length 121 [2022-01-18 08:18:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:12,354 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 6286 transitions. [2022-01-18 08:18:12,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 6286 transitions. [2022-01-18 08:18:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-18 08:18:12,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:12,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:12,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 08:18:12,422 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 139355698, now seen corresponding path program 1 times [2022-01-18 08:18:12,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:12,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864420149] [2022-01-18 08:18:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:12,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:12,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:12,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864420149] [2022-01-18 08:18:12,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864420149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:12,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:12,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 08:18:12,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594137783] [2022-01-18 08:18:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:12,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 08:18:12,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:12,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 08:18:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:12,498 INFO L87 Difference]: Start difference. First operand 2594 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:12,531 INFO L93 Difference]: Finished difference Result 3530 states and 8580 transitions. [2022-01-18 08:18:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 08:18:12,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-18 08:18:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:12,540 INFO L225 Difference]: With dead ends: 3530 [2022-01-18 08:18:12,540 INFO L226 Difference]: Without dead ends: 3530 [2022-01-18 08:18:12,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:12,542 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:12,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 392 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:18:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2022-01-18 08:18:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2620. [2022-01-18 08:18:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2619 states have (on average 2.424207712867507) internal successors, (6349), 2619 states have internal predecessors, (6349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 6349 transitions. [2022-01-18 08:18:12,601 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 6349 transitions. Word has length 131 [2022-01-18 08:18:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:12,602 INFO L470 AbstractCegarLoop]: Abstraction has 2620 states and 6349 transitions. [2022-01-18 08:18:12,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 6349 transitions. [2022-01-18 08:18:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-18 08:18:12,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:12,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:12,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 08:18:12,608 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 863459016, now seen corresponding path program 1 times [2022-01-18 08:18:12,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:12,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960434059] [2022-01-18 08:18:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:12,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:12,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960434059] [2022-01-18 08:18:12,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960434059] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:12,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668864618] [2022-01-18 08:18:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:12,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:12,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:18:12,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 08:18:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:12,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 08:18:12,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:13,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:13,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668864618] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:13,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:13,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 08:18:13,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103652594] [2022-01-18 08:18:13,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:13,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 08:18:13,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 08:18:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 08:18:13,475 INFO L87 Difference]: Start difference. First operand 2620 states and 6349 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:13,596 INFO L93 Difference]: Finished difference Result 4544 states and 11063 transitions. [2022-01-18 08:18:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 08:18:13,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-18 08:18:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:13,606 INFO L225 Difference]: With dead ends: 4544 [2022-01-18 08:18:13,606 INFO L226 Difference]: Without dead ends: 4544 [2022-01-18 08:18:13,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 08:18:13,607 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 245 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:13,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1338 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 08:18:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2022-01-18 08:18:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4544. [2022-01-18 08:18:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4543 states have (on average 2.4351749944970282) internal successors, (11063), 4543 states have internal predecessors, (11063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 11063 transitions. [2022-01-18 08:18:13,690 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 11063 transitions. Word has length 162 [2022-01-18 08:18:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:13,691 INFO L470 AbstractCegarLoop]: Abstraction has 4544 states and 11063 transitions. [2022-01-18 08:18:13,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 11063 transitions. [2022-01-18 08:18:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-18 08:18:13,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:13,702 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:13,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 08:18:13,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:13,925 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1615060600, now seen corresponding path program 2 times [2022-01-18 08:18:13,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307961524] [2022-01-18 08:18:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:13,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-18 08:18:14,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307961524] [2022-01-18 08:18:14,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307961524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:14,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:14,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 08:18:14,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006229064] [2022-01-18 08:18:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:14,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 08:18:14,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 08:18:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:14,036 INFO L87 Difference]: Start difference. First operand 4544 states and 11063 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:14,064 INFO L93 Difference]: Finished difference Result 3344 states and 7707 transitions. [2022-01-18 08:18:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 08:18:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2022-01-18 08:18:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:14,071 INFO L225 Difference]: With dead ends: 3344 [2022-01-18 08:18:14,071 INFO L226 Difference]: Without dead ends: 3312 [2022-01-18 08:18:14,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 08:18:14,072 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 87 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:14,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:18:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2022-01-18 08:18:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2022-01-18 08:18:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3311 states have (on average 2.303533675626699) internal successors, (7627), 3311 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 7627 transitions. [2022-01-18 08:18:14,121 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 7627 transitions. Word has length 224 [2022-01-18 08:18:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:14,122 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 7627 transitions. [2022-01-18 08:18:14,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 7627 transitions. [2022-01-18 08:18:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-18 08:18:14,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:14,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:14,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 08:18:14,129 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -320685280, now seen corresponding path program 1 times [2022-01-18 08:18:14,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:14,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035723829] [2022-01-18 08:18:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:14,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:14,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035723829] [2022-01-18 08:18:14,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035723829] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366163837] [2022-01-18 08:18:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:14,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:14,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:18:14,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 08:18:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:14,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 08:18:14,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:14,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:15,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366163837] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:15,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:15,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-18 08:18:15,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187350013] [2022-01-18 08:18:15,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:15,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 08:18:15,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 08:18:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-18 08:18:15,209 INFO L87 Difference]: Start difference. First operand 3312 states and 7627 transitions. Second operand has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:15,423 INFO L93 Difference]: Finished difference Result 5976 states and 13767 transitions. [2022-01-18 08:18:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-18 08:18:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-01-18 08:18:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:15,436 INFO L225 Difference]: With dead ends: 5976 [2022-01-18 08:18:15,437 INFO L226 Difference]: Without dead ends: 5976 [2022-01-18 08:18:15,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-01-18 08:18:15,438 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 648 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:15,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 2396 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 08:18:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2022-01-18 08:18:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5976. [2022-01-18 08:18:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5975 states have (on average 2.3041004184100418) internal successors, (13767), 5975 states have internal predecessors, (13767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 13767 transitions. [2022-01-18 08:18:15,542 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 13767 transitions. Word has length 225 [2022-01-18 08:18:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:15,542 INFO L470 AbstractCegarLoop]: Abstraction has 5976 states and 13767 transitions. [2022-01-18 08:18:15,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 13767 transitions. [2022-01-18 08:18:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2022-01-18 08:18:15,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:15,557 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:15,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 08:18:15,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-18 08:18:15,780 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 185124256, now seen corresponding path program 2 times [2022-01-18 08:18:15,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:15,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109985634] [2022-01-18 08:18:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:15,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:16,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109985634] [2022-01-18 08:18:16,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109985634] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464228578] [2022-01-18 08:18:16,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:18:16,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:16,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:18:16,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 08:18:16,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 08:18:16,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:18:16,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 08:18:16,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:17,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:17,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464228578] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:17,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:17,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-01-18 08:18:17,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867163532] [2022-01-18 08:18:17,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:17,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-18 08:18:17,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-18 08:18:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-18 08:18:17,813 INFO L87 Difference]: Start difference. First operand 5976 states and 13767 transitions. Second operand has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:18,539 INFO L93 Difference]: Finished difference Result 11304 states and 26047 transitions. [2022-01-18 08:18:18,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 08:18:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2022-01-18 08:18:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:18,562 INFO L225 Difference]: With dead ends: 11304 [2022-01-18 08:18:18,563 INFO L226 Difference]: Without dead ends: 11304 [2022-01-18 08:18:18,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1192, Invalid=2590, Unknown=0, NotChecked=0, Total=3782 [2022-01-18 08:18:18,564 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2055 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:18,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2055 Valid, 2628 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 08:18:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2022-01-18 08:18:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 11304. [2022-01-18 08:18:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11304 states, 11303 states have (on average 2.3044324515615324) internal successors, (26047), 11303 states have internal predecessors, (26047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11304 states to 11304 states and 26047 transitions. [2022-01-18 08:18:18,789 INFO L78 Accepts]: Start accepts. Automaton has 11304 states and 26047 transitions. Word has length 349 [2022-01-18 08:18:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:18,789 INFO L470 AbstractCegarLoop]: Abstraction has 11304 states and 26047 transitions. [2022-01-18 08:18:18,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11304 states and 26047 transitions. [2022-01-18 08:18:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2022-01-18 08:18:18,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:18,824 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:18,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 08:18:19,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:19,039 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2037947040, now seen corresponding path program 3 times [2022-01-18 08:18:19,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:19,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418382805] [2022-01-18 08:18:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:19,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:19,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:19,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418382805] [2022-01-18 08:18:19,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418382805] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:19,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319285912] [2022-01-18 08:18:19,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:18:19,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:19,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:19,710 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-01-18 08:18:19,711 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-01-18 08:18:20,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 08:18:20,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:18:20,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 08:18:20,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:22,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-18 08:18:22,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:18:22,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:18:22,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:18:22,642 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-01-18 08:18:22,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-01-18 08:18:22,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:18:22,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 08:18:22,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-18 08:18:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-01-18 08:18:22,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:23,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-18 08:18:23,357 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:18:23,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-18 08:18:23,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:18:23,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-01-18 08:18:23,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 08:18:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-01-18 08:18:24,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319285912] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:24,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:24,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-01-18 08:18:24,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491427010] [2022-01-18 08:18:24,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:24,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-18 08:18:24,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-18 08:18:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2297, Unknown=1, NotChecked=100, Total=2756 [2022-01-18 08:18:24,432 INFO L87 Difference]: Start difference. First operand 11304 states and 26047 transitions. Second operand has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:34,147 INFO L93 Difference]: Finished difference Result 23411 states and 53779 transitions. [2022-01-18 08:18:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-18 08:18:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2022-01-18 08:18:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:34,215 INFO L225 Difference]: With dead ends: 23411 [2022-01-18 08:18:34,216 INFO L226 Difference]: Without dead ends: 23411 [2022-01-18 08:18:34,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1417 GetRequests, 1171 SyntacticMatches, 20 SemanticMatches, 226 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20671 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10669, Invalid=40636, Unknown=1, NotChecked=450, Total=51756 [2022-01-18 08:18:34,233 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 14625 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14625 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 762 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:34,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14625 Valid, 4281 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 1432 Invalid, 0 Unknown, 762 Unchecked, 1.2s Time] [2022-01-18 08:18:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23411 states. [2022-01-18 08:18:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23411 to 19980. [2022-01-18 08:18:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19980 states, 19979 states have (on average 2.29465939236198) internal successors, (45845), 19979 states have internal predecessors, (45845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19980 states to 19980 states and 45845 transitions. [2022-01-18 08:18:34,777 INFO L78 Accepts]: Start accepts. Automaton has 19980 states and 45845 transitions. Word has length 597 [2022-01-18 08:18:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:34,777 INFO L470 AbstractCegarLoop]: Abstraction has 19980 states and 45845 transitions. [2022-01-18 08:18:34,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19980 states and 45845 transitions. [2022-01-18 08:18:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-01-18 08:18:34,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:34,843 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:34,869 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-01-18 08:18:35,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:35,056 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash -681457465, now seen corresponding path program 1 times [2022-01-18 08:18:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:35,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280634711] [2022-01-18 08:18:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:35,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:35,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280634711] [2022-01-18 08:18:35,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280634711] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438768390] [2022-01-18 08:18:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:35,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:35,713 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-01-18 08:18:35,714 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-01-18 08:18:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:36,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-18 08:18:36,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:37,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:18:38,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438768390] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:38,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:38,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-01-18 08:18:38,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893071671] [2022-01-18 08:18:38,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:38,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-18 08:18:38,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-18 08:18:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-01-18 08:18:38,158 INFO L87 Difference]: Start difference. First operand 19980 states and 45845 transitions. Second operand has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:39,184 INFO L93 Difference]: Finished difference Result 24732 states and 56741 transitions. [2022-01-18 08:18:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 08:18:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 656 [2022-01-18 08:18:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:39,251 INFO L225 Difference]: With dead ends: 24732 [2022-01-18 08:18:39,251 INFO L226 Difference]: Without dead ends: 24732 [2022-01-18 08:18:39,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1303 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2044, Invalid=4436, Unknown=0, NotChecked=0, Total=6480 [2022-01-18 08:18:39,253 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2777 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:39,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2777 Valid, 2752 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 08:18:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24732 states. [2022-01-18 08:18:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24732 to 24732. [2022-01-18 08:18:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24732 states, 24731 states have (on average 2.2943269580688206) internal successors, (56741), 24731 states have internal predecessors, (56741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24732 states to 24732 states and 56741 transitions. [2022-01-18 08:18:39,697 INFO L78 Accepts]: Start accepts. Automaton has 24732 states and 56741 transitions. Word has length 656 [2022-01-18 08:18:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:39,698 INFO L470 AbstractCegarLoop]: Abstraction has 24732 states and 56741 transitions. [2022-01-18 08:18:39,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24732 states and 56741 transitions. [2022-01-18 08:18:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2022-01-18 08:18:39,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:39,739 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:39,758 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-01-18 08:18:39,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-18 08:18:39,943 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 129194109, now seen corresponding path program 2 times [2022-01-18 08:18:39,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338158147] [2022-01-18 08:18:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:39,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked. [2022-01-18 08:18:40,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:40,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338158147] [2022-01-18 08:18:40,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338158147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:18:40,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:18:40,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-18 08:18:40,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249887848] [2022-01-18 08:18:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:18:40,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 08:18:40,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 08:18:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-01-18 08:18:40,697 INFO L87 Difference]: Start difference. First operand 24732 states and 56741 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:18:41,302 INFO L93 Difference]: Finished difference Result 24603 states and 56488 transitions. [2022-01-18 08:18:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 08:18:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 788 [2022-01-18 08:18:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:18:41,342 INFO L225 Difference]: With dead ends: 24603 [2022-01-18 08:18:41,343 INFO L226 Difference]: Without dead ends: 24603 [2022-01-18 08:18:41,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2022-01-18 08:18:41,344 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 760 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:18:41,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1234 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 08:18:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2022-01-18 08:18:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 24590. [2022-01-18 08:18:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24590 states, 24589 states have (on average 2.29602667859612) internal successors, (56457), 24589 states have internal predecessors, (56457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24590 states to 24590 states and 56457 transitions. [2022-01-18 08:18:41,845 INFO L78 Accepts]: Start accepts. Automaton has 24590 states and 56457 transitions. Word has length 788 [2022-01-18 08:18:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:18:41,846 INFO L470 AbstractCegarLoop]: Abstraction has 24590 states and 56457 transitions. [2022-01-18 08:18:41,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:18:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 24590 states and 56457 transitions. [2022-01-18 08:18:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-01-18 08:18:41,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:18:41,881 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:18:41,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 08:18:41,881 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:18:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:18:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash -311280536, now seen corresponding path program 3 times [2022-01-18 08:18:41,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:18:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048424761] [2022-01-18 08:18:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:18:41,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:18:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:18:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 947 proven. 20 refuted. 0 times theorem prover too weak. 4923 trivial. 0 not checked. [2022-01-18 08:18:43,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:18:43,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048424761] [2022-01-18 08:18:43,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048424761] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:18:43,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499300880] [2022-01-18 08:18:43,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:18:43,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:18:43,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:18:43,377 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-01-18 08:18:43,378 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-01-18 08:18:43,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 08:18:43,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:18:43,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-18 08:18:43,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:18:46,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-18 08:18:46,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:18:46,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:18:46,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:18:46,413 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-18 08:18:46,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-18 08:18:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:18:46,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 08:18:46,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-01-18 08:18:46,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:18:46,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:18:46,853 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-01-18 08:18:46,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2022-01-18 08:18:46,905 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-18 08:18:46,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 08:18:46,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-18 08:18:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked. [2022-01-18 08:18:47,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:18:57,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-18 08:18:57,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (not (<= v_ArrVal_1664 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-18 08:18:57,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-18 08:18:57,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-01-18 08:18:57,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664)))) is different from false [2022-01-18 08:18:57,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (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_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-01-18 08:18:57,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-01-18 08:18:57,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) is different from false [2022-01-18 08:18:57,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) is different from false [2022-01-18 08:18:57,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) is different from false [2022-01-18 08:18:58,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:18:58,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 90 [2022-01-18 08:18:58,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:18:58,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 143 [2022-01-18 08:18:58,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-01-18 08:18:58,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:18:58,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-01-18 08:18:58,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-18 08:18:58,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:18:58,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2022-01-18 08:18:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 411 refuted. 0 times theorem prover too weak. 4318 trivial. 698 not checked. [2022-01-18 08:18:59,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499300880] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:18:59,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:18:59,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 21] total 59 [2022-01-18 08:18:59,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828381478] [2022-01-18 08:18:59,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:18:59,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-18 08:18:59,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:18:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-18 08:18:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2068, Unknown=10, NotChecked=1030, Total=3422 [2022-01-18 08:18:59,901 INFO L87 Difference]: Start difference. First operand 24590 states and 56457 transitions. Second operand has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:19:01,973 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (or .cse4 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) .cse4 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse5 84) 4) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse5 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:02,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:03,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse3 84) 4) 4) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:03,545 WARN L838 $PredicateComparison]: unable to prove that (and (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:05,619 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-01-18 08:19:07,533 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:08,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:08,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:09,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:09,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:10,037 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:12,046 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-01-18 08:19:12,917 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:19:13,908 INFO L93 Difference]: Finished difference Result 135976 states and 316700 transitions. [2022-01-18 08:19:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-01-18 08:19:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 792 [2022-01-18 08:19:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:19:14,301 INFO L225 Difference]: With dead ends: 135976 [2022-01-18 08:19:14,301 INFO L226 Difference]: Without dead ends: 135976 [2022-01-18 08:19:14,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1554 SyntacticMatches, 17 SemanticMatches, 131 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2204, Invalid=9855, Unknown=23, NotChecked=5474, Total=17556 [2022-01-18 08:19:14,302 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 5016 mSDsluCounter, 13050 mSDsCounter, 0 mSdLazyCounter, 3068 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 13449 SdHoareTripleChecker+Invalid, 12643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 3068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9253 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 08:19:14,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5016 Valid, 13449 Invalid, 12643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 3068 Invalid, 0 Unknown, 9253 Unchecked, 1.5s Time] [2022-01-18 08:19:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135976 states. [2022-01-18 08:19:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135976 to 58018. [2022-01-18 08:19:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58018 states, 58017 states have (on average 2.3215781581260666) internal successors, (134691), 58017 states have internal predecessors, (134691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:19:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58018 states to 58018 states and 134691 transitions. [2022-01-18 08:19:15,863 INFO L78 Accepts]: Start accepts. Automaton has 58018 states and 134691 transitions. Word has length 792 [2022-01-18 08:19:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:19:15,864 INFO L470 AbstractCegarLoop]: Abstraction has 58018 states and 134691 transitions. [2022-01-18 08:19:15,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:19:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 58018 states and 134691 transitions. [2022-01-18 08:19:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-01-18 08:19:15,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:19:15,962 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:19:15,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 08:19:16,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:19:16,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:19:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:19:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 574269212, now seen corresponding path program 4 times [2022-01-18 08:19:16,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:19:16,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083287118] [2022-01-18 08:19:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:19:16,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:19:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:19:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3827 proven. 194 refuted. 0 times theorem prover too weak. 1869 trivial. 0 not checked. [2022-01-18 08:19:17,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:19:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083287118] [2022-01-18 08:19:17,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083287118] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:19:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849363914] [2022-01-18 08:19:17,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 08:19:17,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:19:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:19:17,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:19:17,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 08:19:23,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 08:19:23,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:19:23,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 08:19:23,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:19:24,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-18 08:19:24,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:19:24,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:19:24,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:19:24,461 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-18 08:19:24,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-18 08:19:24,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:19:24,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 08:19:24,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-18 08:19:24,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:19:24,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 08:19:24,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:19:24,896 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-18 08:19:24,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-18 08:19:24,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:19:24,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 08:19:24,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-01-18 08:19:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2706 proven. 118 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2022-01-18 08:19:25,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:19:49,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:19:49,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-18 08:19:49,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:19:49,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-18 08:19:49,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:19:49,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (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_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-18 08:19:49,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) is different from false [2022-01-18 08:19:49,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) is different from false [2022-01-18 08:19:50,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))))))) is different from false [2022-01-18 08:19:50,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) is different from false [2022-01-18 08:19:50,364 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:19:50,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-01-18 08:19:50,373 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:19:50,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-01-18 08:19:50,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 809 treesize of output 789 [2022-01-18 08:19:50,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 789 [2022-01-18 08:19:50,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-18 08:19:50,563 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:19:50,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 220 [2022-01-18 08:19:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2563 proven. 89 refuted. 0 times theorem prover too weak. 3072 trivial. 166 not checked. [2022-01-18 08:19:51,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849363914] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:19:51,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:19:51,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 22] total 65 [2022-01-18 08:19:51,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976994581] [2022-01-18 08:19:51,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:19:51,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 08:19:51,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:19:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 08:19:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2603, Unknown=39, NotChecked=1150, Total=4160 [2022-01-18 08:19:51,113 INFO L87 Difference]: Start difference. First operand 58018 states and 134691 transitions. Second operand has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:19:52,189 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:52,606 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse3 .cse2))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2) 20))))))) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:19:53,076 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0)) is different from false [2022-01-18 08:19:53,550 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 1)) is different from false [2022-01-18 08:19:54,067 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse3 .cse2))) (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))))))))) is different from false [2022-01-18 08:19:54,481 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1)))))))) is different from false [2022-01-18 08:19:55,029 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:57,065 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:19:57,630 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1)) is different from false [2022-01-18 08:19:59,780 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1)) is different from false [2022-01-18 08:20:01,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= (+ (- 1) (select .cse0 .cse1)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse3)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* (select .cse0 84) 4) 8) (<= (* .cse4 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (not (= .cse4 20)) (<= |c_~#stored_elements~0.base| 6) (= (+ (- 1) (select (select |c_#memory_int| 7) .cse1)) 1))) is different from false [2022-01-18 08:20:01,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (+ (- 1) (select .cse0 (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2)))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 84) 4) 8) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-18 08:20:02,155 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 4) 8) (<= (* .cse2 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (not (= .cse2 20)))) is different from false [2022-01-18 08:20:02,551 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) (<= (* (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 4) 8)) is different from false [2022-01-18 08:20:03,544 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:20:04,038 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1)) is different from false [2022-01-18 08:20:04,666 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-18 08:20:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:20:06,208 INFO L93 Difference]: Finished difference Result 194303 states and 443137 transitions. [2022-01-18 08:20:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-18 08:20:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 792 [2022-01-18 08:20:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:20:06,766 INFO L225 Difference]: With dead ends: 194303 [2022-01-18 08:20:06,767 INFO L226 Difference]: Without dead ends: 194303 [2022-01-18 08:20:06,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1735 GetRequests, 1586 SyntacticMatches, 20 SemanticMatches, 129 ConstructedPredicates, 27 IntricatePredicates, 1 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=1521, Invalid=9243, Unknown=56, NotChecked=6210, Total=17030 [2022-01-18 08:20:06,768 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 6069 mSDsluCounter, 15789 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6069 SdHoareTripleChecker+Valid, 16278 SdHoareTripleChecker+Invalid, 12717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9243 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 08:20:06,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6069 Valid, 16278 Invalid, 12717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3309 Invalid, 0 Unknown, 9243 Unchecked, 1.5s Time] [2022-01-18 08:20:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194303 states. [2022-01-18 08:20:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194303 to 93381. [2022-01-18 08:20:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 93380 states have (on average 2.411169415292354) internal successors, (225155), 93380 states have internal predecessors, (225155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:20:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 225155 transitions. [2022-01-18 08:20:09,504 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 225155 transitions. Word has length 792 [2022-01-18 08:20:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:20:09,505 INFO L470 AbstractCegarLoop]: Abstraction has 93381 states and 225155 transitions. [2022-01-18 08:20:09,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:20:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 225155 transitions. [2022-01-18 08:20:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2022-01-18 08:20:09,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:20:09,875 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:20:09,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 08:20:10,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:20:10,076 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 08:20:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:20:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1148069001, now seen corresponding path program 1 times [2022-01-18 08:20:10,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:20:10,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92882800] [2022-01-18 08:20:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:20:10,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:20:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:20:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3906 proven. 115 refuted. 0 times theorem prover too weak. 1869 trivial. 0 not checked. [2022-01-18 08:20:11,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:20:11,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92882800] [2022-01-18 08:20:11,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92882800] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:20:11,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881205540] [2022-01-18 08:20:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:20:11,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:20:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:20:11,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:20:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 08:20:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:20:12,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-18 08:20:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:20:13,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-18 08:20:13,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:20:13,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:20:14,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:20:14,145 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-18 08:20:14,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-18 08:20:14,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:20:14,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 08:20:14,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-18 08:20:14,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:20:14,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 08:20:14,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:20:14,550 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-18 08:20:14,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-18 08:20:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 08:20:14,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 08:20:14,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-01-18 08:20:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3292 proven. 302 refuted. 0 times theorem prover too weak. 2296 trivial. 0 not checked. [2022-01-18 08:20:14,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:20:31,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:20:31,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:20:31,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-01-18 08:20:31,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:20:32,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-18 08:20:32,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (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_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-01-18 08:20:32,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1)))))))) is different from false [2022-01-18 08:20:32,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse3))))))) is different from false [2022-01-18 08:20:32,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse1))))))) is different from false [2022-01-18 08:20:32,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2438))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse2 .cse1)))))))) is different from false [2022-01-18 08:20:32,541 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:20:32,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-01-18 08:20:32,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:20:32,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-01-18 08:20:32,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 273 [2022-01-18 08:20:32,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 831 treesize of output 811 [2022-01-18 08:20:32,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 Received shutdown request... [2022-01-18 08:31:53,779 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 08:31:53,798 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-18 08:31:53,800 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-18 08:31:53,813 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-01-18 08:31:53,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 08:31:54,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 08:31:54,020 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 23ms.. [2022-01-18 08:31:54,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-18 08:31:54,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-18 08:31:54,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-18 08:31:54,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-18 08:31:54,023 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2022-01-18 08:31:54,025 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 08:31:54,025 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 08:31:54,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 08:31:54 BasicIcfg [2022-01-18 08:31:54,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 08:31:54,027 INFO L158 Benchmark]: Toolchain (without parser) took 826726.60ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 306.6MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2022-01-18 08:31:54,028 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 08:31:54,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.68ms. Allocated memory is still 362.8MB. Free memory was 306.4MB in the beginning and 315.9MB in the end (delta: -9.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. [2022-01-18 08:31:54,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 362.8MB. Free memory was 315.9MB in the beginning and 312.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 08:31:54,028 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 362.8MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 08:31:54,028 INFO L158 Benchmark]: RCFGBuilder took 464.56ms. Allocated memory is still 362.8MB. Free memory was 310.6MB in the beginning and 290.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 08:31:54,029 INFO L158 Benchmark]: TraceAbstraction took 825670.27ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 290.7MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2022-01-18 08:31:54,030 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 512.68ms. Allocated memory is still 362.8MB. Free memory was 306.4MB in the beginning and 315.9MB in the end (delta: -9.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 362.8MB. Free memory was 315.9MB in the beginning and 312.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 362.8MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 464.56ms. Allocated memory is still 362.8MB. Free memory was 310.6MB in the beginning and 290.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 825670.27ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 290.7MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 23ms.. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 23ms.. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 23ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 23ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 825.4s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.9s, AutomataDifference: 43.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32961 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32961 mSDsluCounter, 46587 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19258 IncrementalHoareTripleChecker+Unchecked, 43618 mSDsCounter, 1631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9066 IncrementalHoareTripleChecker+Invalid, 29955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1631 mSolverCounterUnsat, 3463 mSDtfsCounter, 9066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7840 GetRequests, 7070 SyntacticMatches, 58 SemanticMatches, 712 ConstructedPredicates, 51 IntricatePredicates, 1 DeprecatedPredicates, 31447 ImplicationChecksByTransitivity, 70.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93381occurred in iteration=13, InterpolantAutomatonStates: 515, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 183234 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 58.5s InterpolantComputationTime, 8588 NumberOfCodeBlocks, 7618 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12134 ConstructedInterpolants, 105 QuantifiedInterpolants, 48544 SizeOfPredicates, 109 NumberOfNonLiveVariables, 5657 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 44980/64449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown