/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19
[2022-03-15 12:51:01,109 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-03-15 12:51:01,110 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-03-15 12:51:01,154 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-03-15 12:51:01,154 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-03-15 12:51:01,155 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-03-15 12:51:01,156 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-03-15 12:51:01,157 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-03-15 12:51:01,158 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-03-15 12:51:01,158 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-03-15 12:51:01,161 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-03-15 12:51:01,161 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-03-15 12:51:01,161 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-03-15 12:51:01,162 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-03-15 12:51:01,163 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-03-15 12:51:01,163 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-03-15 12:51:01,164 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-03-15 12:51:01,164 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-03-15 12:51:01,165 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-03-15 12:51:01,166 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-03-15 12:51:01,167 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-03-15 12:51:01,168 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-03-15 12:51:01,169 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-03-15 12:51:01,169 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-03-15 12:51:01,171 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-03-15 12:51:01,171 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-03-15 12:51:01,172 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-03-15 12:51:01,172 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-03-15 12:51:01,172 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-03-15 12:51:01,173 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-03-15 12:51:01,173 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-03-15 12:51:01,174 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-03-15 12:51:01,174 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-03-15 12:51:01,174 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-03-15 12:51:01,175 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-03-15 12:51:01,175 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-03-15 12:51:01,176 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-03-15 12:51:01,176 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-03-15 12:51:01,176 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-03-15 12:51:01,177 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-03-15 12:51:01,177 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-03-15 12:51:01,191 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.epf
[2022-03-15 12:51:01,208 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-03-15 12:51:01,208 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-03-15 12:51:01,209 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-03-15 12:51:01,209 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-03-15 12:51:01,209 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-03-15 12:51:01,209 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-03-15 12:51:01,210 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-03-15 12:51:01,210 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-03-15 12:51:01,210 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-03-15 12:51:01,210 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-03-15 12:51:01,210 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-03-15 12:51:01,210 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-03-15 12:51:01,210 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-03-15 12:51:01,211 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-03-15 12:51:01,211 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-03-15 12:51:01,212 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-03-15 12:51:01,212 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-03-15 12:51:01,213 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-03-15 12:51:01,213 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-03-15 12:51:01,213 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-03-15 12:51:01,213 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-03-15 12:51:01,340 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-03-15 12:51:01,358 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-03-15 12:51:01,359 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-03-15 12:51:01,360 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-03-15 12:51:01,364 INFO  L275        PluginConnector]: CDTParser initialized
[2022-03-15 12:51:01,365 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i
[2022-03-15 12:51:01,399 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1f1f36c/5be828ec26264fdfa43c6cd3696715ae/FLAGd5a656ef6
[2022-03-15 12:51:01,749 INFO  L306              CDTParser]: Found 1 translation units.
[2022-03-15 12:51:01,749 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i
[2022-03-15 12:51:01,768 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1f1f36c/5be828ec26264fdfa43c6cd3696715ae/FLAGd5a656ef6
[2022-03-15 12:51:02,144 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1f1f36c/5be828ec26264fdfa43c6cd3696715ae
[2022-03-15 12:51:02,146 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-03-15 12:51:02,146 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-03-15 12:51:02,147 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-03-15 12:51:02,151 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-03-15 12:51:02,153 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-03-15 12:51:02,154 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,154 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e85d6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02, skipping insertion in model container
[2022-03-15 12:51:02,155 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,159 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-03-15 12:51:02,191 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-03-15 12:51:02,428 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-03-15 12:51:02,431 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-03-15 12:51:02,433 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-03-15 12:51:02,438 INFO  L203         MainTranslator]: Completed pre-run
[2022-03-15 12:51:02,477 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-03-15 12:51:02,480 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-03-15 12:51:02,485 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-03-15 12:51:02,525 INFO  L208         MainTranslator]: Completed translation
[2022-03-15 12:51:02,526 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02 WrapperNode
[2022-03-15 12:51:02,526 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-03-15 12:51:02,527 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-03-15 12:51:02,527 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-03-15 12:51:02,527 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-03-15 12:51:02,531 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,559 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,588 INFO  L137                Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204
[2022-03-15 12:51:02,588 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-03-15 12:51:02,589 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-03-15 12:51:02,589 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-03-15 12:51:02,589 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-03-15 12:51:02,594 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,594 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,603 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,603 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,609 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,611 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,621 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,623 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-03-15 12:51:02,624 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-03-15 12:51:02,624 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-03-15 12:51:02,624 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-03-15 12:51:02,630 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (1/1) ...
[2022-03-15 12:51:02,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-03-15 12:51:02,646 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:02,655 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-03-15 12:51:02,673 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-03-15 12:51:02,682 INFO  L130     BoogieDeclarations]: Found specification of procedure t1
[2022-03-15 12:51:02,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure t1
[2022-03-15 12:51:02,682 INFO  L130     BoogieDeclarations]: Found specification of procedure t2
[2022-03-15 12:51:02,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure t2
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-03-15 12:51:02,683 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-03-15 12:51:02,683 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-03-15 12:51:02,684 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-03-15 12:51:02,820 INFO  L234             CfgBuilder]: Building ICFG
[2022-03-15 12:51:02,821 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-03-15 12:51:03,062 INFO  L275             CfgBuilder]: Performing block encoding
[2022-03-15 12:51:03,068 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-03-15 12:51:03,069 INFO  L299             CfgBuilder]: Removed 2 assume(true) statements.
[2022-03-15 12:51:03,070 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:51:03 BoogieIcfgContainer
[2022-03-15 12:51:03,070 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-03-15 12:51:03,071 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-03-15 12:51:03,071 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-03-15 12:51:03,076 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-03-15 12:51:03,076 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:51:02" (1/3) ...
[2022-03-15 12:51:03,076 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ddfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:51:03, skipping insertion in model container
[2022-03-15 12:51:03,076 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:02" (2/3) ...
[2022-03-15 12:51:03,077 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ddfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:51:03, skipping insertion in model container
[2022-03-15 12:51:03,077 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:51:03" (3/3) ...
[2022-03-15 12:51:03,078 INFO  L111   eAbstractionObserver]: Analyzing ICFG queue_ok.i
[2022-03-15 12:51:03,081 WARN  L150   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-03-15 12:51:03,082 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-03-15 12:51:03,082 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-03-15 12:51:03,082 INFO  L534   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-03-15 12:51:03,118 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,118 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,118 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,119 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,120 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,121 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,121 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,121 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,121 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,122 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,123 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,123 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,123 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,123 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,123 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,124 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,125 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,126 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,127 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,128 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,129 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,130 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,130 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,130 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,130 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,131 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,132 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,133 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,134 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,135 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,136 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,137 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,138 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,138 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,138 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,138 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,138 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,139 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,140 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,141 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,141 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,141 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,141 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,141 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,142 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,143 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,143 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,143 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,143 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,143 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,144 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,145 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,146 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,147 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,147 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,147 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,147 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,148 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,148 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,150 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,155 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,162 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,163 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,164 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,165 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,166 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,167 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,168 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,169 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,170 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,171 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,172 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,173 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,174 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,175 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,176 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,177 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,178 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,179 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,180 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,181 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,182 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,182 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,182 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,182 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,184 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,184 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,184 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,185 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,186 WARN  L322   ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,188 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,188 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,188 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,190 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,190 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,191 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,192 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,193 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,194 WARN  L322   ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-03-15 12:51:03,196 INFO  L148    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2022-03-15 12:51:03,233 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-03-15 12:51:03,237 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, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-03-15 12:51:03,237 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2022-03-15 12:51:03,270 INFO  L111   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 225 places, 231 transitions, 478 flow
[2022-03-15 12:51:03,592 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-03-15 12:51:03,631 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-03-15 12:51:03,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-03-15 12:51:03,639 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:03,639 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-03-15 12:51:03,640 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-03-15 12:51:03,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:03,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times
[2022-03-15 12:51:03,650 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:03,650 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740936889]
[2022-03-15 12:51:03,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:03,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:03,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:03,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:03,889 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:03,889 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740936889]
[2022-03-15 12:51:03,889 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740936889] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:03,889 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:03,890 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-03-15 12:51:03,890 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844990989]
[2022-03-15 12:51:03,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:03,893 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-03-15 12:51:03,894 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:03,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-03-15 12:51:03,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-03-15 12:51:03,931 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-03-15 12:51:04,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:04,103 INFO  L93              Difference]: Finished difference Result 14373 states and 40204 transitions.
[2022-03-15 12:51:04,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-03-15 12:51:04,107 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-03-15 12:51:04,107 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:04,180 INFO  L225             Difference]: With dead ends: 14373
[2022-03-15 12:51:04,180 INFO  L226             Difference]: Without dead ends: 14373
[2022-03-15 12:51:04,181 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-03-15 12:51:04,184 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-03-15 12:51:04,185 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-03-15 12:51:04,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14373 states.
[2022-03-15 12:51:04,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14373.
[2022-03-15 12:51:04,666 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-03-15 12:51:04,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 40204 transitions.
[2022-03-15 12:51:04,715 INFO  L78                 Accepts]: Start accepts. Automaton has 14373 states and 40204 transitions. Word has length 58
[2022-03-15 12:51:04,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:04,716 INFO  L470      AbstractCegarLoop]: Abstraction has 14373 states and 40204 transitions.
[2022-03-15 12:51:04,716 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-03-15 12:51:04,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 14373 states and 40204 transitions.
[2022-03-15 12:51:04,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2022-03-15 12:51:04,745 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:04,745 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-03-15 12:51:04,746 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-03-15 12:51:04,746 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-03-15 12:51:04,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:04,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times
[2022-03-15 12:51:04,749 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:04,749 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902270364]
[2022-03-15 12:51:04,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:04,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:04,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:05,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:05,165 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:05,165 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902270364]
[2022-03-15 12:51:05,167 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902270364] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:05,167 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:05,168 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-03-15 12:51:05,168 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960770641]
[2022-03-15 12:51:05,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:05,169 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-03-15 12:51:05,169 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:05,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-03-15 12:51:05,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-03-15 12:51:05,170 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-03-15 12:51:05,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:05,590 INFO  L93              Difference]: Finished difference Result 14370 states and 40200 transitions.
[2022-03-15 12:51:05,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-03-15 12:51:05,591 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-03-15 12:51:05,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:05,636 INFO  L225             Difference]: With dead ends: 14370
[2022-03-15 12:51:05,637 INFO  L226             Difference]: Without dead ends: 14370
[2022-03-15 12:51:05,637 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-03-15 12:51:05,638 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.1s IncrementalHoareTripleChecker+Time
[2022-03-15 12:51:05,638 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.1s Time]
[2022-03-15 12:51:05,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14370 states.
[2022-03-15 12:51:06,020 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14370 to 14370.
[2022-03-15 12:51:06,037 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-03-15 12:51:06,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14370 states to 14370 states and 40200 transitions.
[2022-03-15 12:51:06,083 INFO  L78                 Accepts]: Start accepts. Automaton has 14370 states and 40200 transitions. Word has length 120
[2022-03-15 12:51:06,084 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:06,084 INFO  L470      AbstractCegarLoop]: Abstraction has 14370 states and 40200 transitions.
[2022-03-15 12:51:06,085 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-03-15 12:51:06,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 14370 states and 40200 transitions.
[2022-03-15 12:51:06,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2022-03-15 12:51:06,102 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:06,102 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-03-15 12:51:06,102 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-03-15 12:51:06,103 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-03-15 12:51:06,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:06,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times
[2022-03-15 12:51:06,104 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:06,105 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583873923]
[2022-03-15 12:51:06,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:06,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:06,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:06,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:06,222 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:06,222 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583873923]
[2022-03-15 12:51:06,222 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583873923] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:06,222 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:06,222 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-03-15 12:51:06,224 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674194433]
[2022-03-15 12:51:06,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:06,225 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-03-15 12:51:06,225 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:06,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-03-15 12:51:06,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-03-15 12:51:06,226 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-03-15 12:51:06,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:06,244 INFO  L93              Difference]: Finished difference Result 2713 states and 6565 transitions.
[2022-03-15 12:51:06,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-03-15 12:51:06,245 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-03-15 12:51:06,246 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:06,250 INFO  L225             Difference]: With dead ends: 2713
[2022-03-15 12:51:06,251 INFO  L226             Difference]: Without dead ends: 2594
[2022-03-15 12:51:06,251 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-03-15 12:51:06,255 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-03-15 12:51:06,255 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-03-15 12:51:06,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2594 states.
[2022-03-15 12:51:06,297 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594.
[2022-03-15 12:51:06,300 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-03-15 12:51:06,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 6286 transitions.
[2022-03-15 12:51:06,305 INFO  L78                 Accepts]: Start accepts. Automaton has 2594 states and 6286 transitions. Word has length 121
[2022-03-15 12:51:06,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:06,306 INFO  L470      AbstractCegarLoop]: Abstraction has 2594 states and 6286 transitions.
[2022-03-15 12:51:06,306 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-03-15 12:51:06,306 INFO  L276                IsEmpty]: Start isEmpty. Operand 2594 states and 6286 transitions.
[2022-03-15 12:51:06,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2022-03-15 12:51:06,350 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:06,350 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-03-15 12:51:06,350 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-03-15 12:51:06,350 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-03-15 12:51:06,351 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:06,351 INFO  L85        PathProgramCache]: Analyzing trace with hash 139355698, now seen corresponding path program 1 times
[2022-03-15 12:51:06,351 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:06,351 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031787696]
[2022-03-15 12:51:06,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:06,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:06,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:06,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:06,409 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:06,409 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031787696]
[2022-03-15 12:51:06,409 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031787696] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:06,409 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:06,409 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-03-15 12:51:06,409 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134237496]
[2022-03-15 12:51:06,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:06,410 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-03-15 12:51:06,410 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:06,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-03-15 12:51:06,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-03-15 12:51:06,410 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-03-15 12:51:06,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:06,435 INFO  L93              Difference]: Finished difference Result 3530 states and 8580 transitions.
[2022-03-15 12:51:06,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-03-15 12:51:06,436 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-03-15 12:51:06,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:06,442 INFO  L225             Difference]: With dead ends: 3530
[2022-03-15 12:51:06,442 INFO  L226             Difference]: Without dead ends: 3530
[2022-03-15 12:51:06,443 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-03-15 12:51:06,447 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-03-15 12:51:06,448 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-03-15 12:51:06,454 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3530 states.
[2022-03-15 12:51:06,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2620.
[2022-03-15 12:51:06,492 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-03-15 12:51:06,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 6349 transitions.
[2022-03-15 12:51:06,497 INFO  L78                 Accepts]: Start accepts. Automaton has 2620 states and 6349 transitions. Word has length 131
[2022-03-15 12:51:06,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:06,498 INFO  L470      AbstractCegarLoop]: Abstraction has 2620 states and 6349 transitions.
[2022-03-15 12:51:06,499 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-03-15 12:51:06,499 INFO  L276                IsEmpty]: Start isEmpty. Operand 2620 states and 6349 transitions.
[2022-03-15 12:51:06,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2022-03-15 12:51:06,504 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:06,505 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-03-15 12:51:06,505 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-03-15 12:51:06,505 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-03-15 12:51:06,506 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:06,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 863459016, now seen corresponding path program 1 times
[2022-03-15 12:51:06,506 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:06,506 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970841468]
[2022-03-15 12:51:06,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:06,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:06,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:06,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:06,562 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:06,562 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970841468]
[2022-03-15 12:51:06,562 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970841468] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:06,562 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649264965]
[2022-03-15 12:51:06,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:06,562 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:06,563 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:06,564 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-03-15 12:51:06,569 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-03-15 12:51:06,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:06,676 INFO  L263         TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-03-15 12:51:06,682 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:06,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:06,899 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:07,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:07,102 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649264965] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:07,102 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:07,102 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2022-03-15 12:51:07,102 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439844668]
[2022-03-15 12:51:07,103 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:07,103 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-03-15 12:51:07,103 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:07,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-03-15 12:51:07,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2022-03-15 12:51:07,104 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-03-15 12:51:07,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:07,237 INFO  L93              Difference]: Finished difference Result 4544 states and 11063 transitions.
[2022-03-15 12:51:07,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-03-15 12:51:07,238 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-03-15 12:51:07,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:07,245 INFO  L225             Difference]: With dead ends: 4544
[2022-03-15 12:51:07,245 INFO  L226             Difference]: Without dead ends: 4544
[2022-03-15 12:51:07,245 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182
[2022-03-15 12:51:07,246 INFO  L933         BasicCegarLoop]: 215 mSDtfsCounter, 245 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time
[2022-03-15 12:51:07,246 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.0s Time]
[2022-03-15 12:51:07,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4544 states.
[2022-03-15 12:51:07,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4544.
[2022-03-15 12:51:07,299 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-03-15 12:51:07,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 11063 transitions.
[2022-03-15 12:51:07,308 INFO  L78                 Accepts]: Start accepts. Automaton has 4544 states and 11063 transitions. Word has length 162
[2022-03-15 12:51:07,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:07,308 INFO  L470      AbstractCegarLoop]: Abstraction has 4544 states and 11063 transitions.
[2022-03-15 12:51:07,308 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-03-15 12:51:07,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 4544 states and 11063 transitions.
[2022-03-15 12:51:07,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2022-03-15 12:51:07,315 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:07,316 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-03-15 12:51:07,346 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-03-15 12:51:07,533 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-03-15 12:51:07,534 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-03-15 12:51:07,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:07,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -1615060600, now seen corresponding path program 2 times
[2022-03-15 12:51:07,534 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:07,535 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365586294]
[2022-03-15 12:51:07,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:07,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:07,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:07,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2022-03-15 12:51:07,617 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:07,617 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365586294]
[2022-03-15 12:51:07,617 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365586294] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:07,618 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:07,618 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-03-15 12:51:07,618 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873596728]
[2022-03-15 12:51:07,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:07,618 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-03-15 12:51:07,618 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:07,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-03-15 12:51:07,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-03-15 12:51:07,619 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-03-15 12:51:07,640 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:07,640 INFO  L93              Difference]: Finished difference Result 3344 states and 7707 transitions.
[2022-03-15 12:51:07,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-03-15 12:51:07,640 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-03-15 12:51:07,641 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:07,646 INFO  L225             Difference]: With dead ends: 3344
[2022-03-15 12:51:07,646 INFO  L226             Difference]: Without dead ends: 3312
[2022-03-15 12:51:07,647 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-03-15 12:51:07,647 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-03-15 12:51:07,647 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-03-15 12:51:07,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3312 states.
[2022-03-15 12:51:07,683 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312.
[2022-03-15 12:51:07,685 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-03-15 12:51:07,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 7627 transitions.
[2022-03-15 12:51:07,690 INFO  L78                 Accepts]: Start accepts. Automaton has 3312 states and 7627 transitions. Word has length 224
[2022-03-15 12:51:07,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:07,691 INFO  L470      AbstractCegarLoop]: Abstraction has 3312 states and 7627 transitions.
[2022-03-15 12:51:07,691 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-03-15 12:51:07,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 3312 states and 7627 transitions.
[2022-03-15 12:51:07,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2022-03-15 12:51:07,696 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:07,696 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-03-15 12:51:07,696 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-03-15 12:51:07,696 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-03-15 12:51:07,697 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:07,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -320685280, now seen corresponding path program 1 times
[2022-03-15 12:51:07,697 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:07,697 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987634434]
[2022-03-15 12:51:07,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:07,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:07,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:07,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:07,788 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:07,788 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987634434]
[2022-03-15 12:51:07,788 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987634434] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:07,788 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383342177]
[2022-03-15 12:51:07,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:07,788 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:07,788 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:07,799 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-03-15 12:51:07,828 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-03-15 12:51:07,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:07,956 INFO  L263         TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-03-15 12:51:07,972 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:08,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:08,336 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:08,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:08,721 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [383342177] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:08,721 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:08,721 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18
[2022-03-15 12:51:08,721 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867611659]
[2022-03-15 12:51:08,721 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:08,722 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-03-15 12:51:08,722 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:08,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-03-15 12:51:08,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2022-03-15 12:51:08,723 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-03-15 12:51:08,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:08,909 INFO  L93              Difference]: Finished difference Result 5976 states and 13767 transitions.
[2022-03-15 12:51:08,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2022-03-15 12:51:08,909 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-03-15 12:51:08,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:08,920 INFO  L225             Difference]: With dead ends: 5976
[2022-03-15 12:51:08,920 INFO  L226             Difference]: Without dead ends: 5976
[2022-03-15 12:51:08,921 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-03-15 12:51:08,921 INFO  L933         BasicCegarLoop]: 211 mSDtfsCounter, 648 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-15 12:51:08,921 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-03-15 12:51:08,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5976 states.
[2022-03-15 12:51:08,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5976.
[2022-03-15 12:51:09,005 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-03-15 12:51:09,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 13767 transitions.
[2022-03-15 12:51:09,017 INFO  L78                 Accepts]: Start accepts. Automaton has 5976 states and 13767 transitions. Word has length 225
[2022-03-15 12:51:09,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:09,017 INFO  L470      AbstractCegarLoop]: Abstraction has 5976 states and 13767 transitions.
[2022-03-15 12:51:09,018 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-03-15 12:51:09,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 5976 states and 13767 transitions.
[2022-03-15 12:51:09,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2022-03-15 12:51:09,029 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:09,029 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-03-15 12:51:09,067 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2022-03-15 12:51:09,243 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-03-15 12:51:09,244 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-03-15 12:51:09,244 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:09,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 185124256, now seen corresponding path program 2 times
[2022-03-15 12:51:09,244 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:09,245 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699891281]
[2022-03-15 12:51:09,245 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:09,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:09,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:09,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:09,492 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:09,492 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699891281]
[2022-03-15 12:51:09,492 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699891281] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:09,492 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341430739]
[2022-03-15 12:51:09,492 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-03-15 12:51:09,493 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:09,493 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:09,504 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-03-15 12:51:09,504 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-03-15 12:51:09,689 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-03-15 12:51:09,690 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-03-15 12:51:09,692 INFO  L263         TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core
[2022-03-15 12:51:09,696 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:10,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:10,213 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:10,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:10,806 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [341430739] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:10,806 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:10,806 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34
[2022-03-15 12:51:10,806 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181408117]
[2022-03-15 12:51:10,806 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:10,807 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2022-03-15 12:51:10,807 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:10,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2022-03-15 12:51:10,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122
[2022-03-15 12:51:10,808 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-03-15 12:51:11,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:11,366 INFO  L93              Difference]: Finished difference Result 11304 states and 26047 transitions.
[2022-03-15 12:51:11,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2022-03-15 12:51:11,367 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-03-15 12:51:11,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:11,386 INFO  L225             Difference]: With dead ends: 11304
[2022-03-15 12:51:11,386 INFO  L226             Difference]: Without dead ends: 11304
[2022-03-15 12:51:11,387 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1192, Invalid=2590, Unknown=0, NotChecked=0, Total=3782
[2022-03-15 12:51:11,388 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-03-15 12:51:11,388 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-03-15 12:51:11,399 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11304 states.
[2022-03-15 12:51:11,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 11304.
[2022-03-15 12:51:11,572 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-03-15 12:51:11,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11304 states to 11304 states and 26047 transitions.
[2022-03-15 12:51:11,590 INFO  L78                 Accepts]: Start accepts. Automaton has 11304 states and 26047 transitions. Word has length 349
[2022-03-15 12:51:11,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:11,590 INFO  L470      AbstractCegarLoop]: Abstraction has 11304 states and 26047 transitions.
[2022-03-15 12:51:11,590 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-03-15 12:51:11,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 11304 states and 26047 transitions.
[2022-03-15 12:51:11,609 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 598
[2022-03-15 12:51:11,609 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:11,610 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-03-15 12:51:11,627 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-03-15 12:51:11,827 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-03-15 12:51:11,828 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-03-15 12:51:11,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:11,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 2037947040, now seen corresponding path program 3 times
[2022-03-15 12:51:11,828 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:11,829 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990640374]
[2022-03-15 12:51:11,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:11,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:11,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:12,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:12,309 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:12,309 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990640374]
[2022-03-15 12:51:12,309 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990640374] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:12,309 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364666783]
[2022-03-15 12:51:12,309 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-03-15 12:51:12,310 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:12,310 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:12,311 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-03-15 12:51:12,312 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-03-15 12:51:12,518 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2022-03-15 12:51:12,519 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-03-15 12:51:12,521 INFO  L263         TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-03-15 12:51:12,528 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:14,213 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-03-15 12:51:14,289 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:51:14,290 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-03-15 12:51:14,454 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:51:14,462 INFO  L353             Elim1Store]: treesize reduction 23, result has 28.1 percent of original size
[2022-03-15 12:51:14,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27
[2022-03-15 12:51:14,514 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:51:14,515 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-03-15 12:51:14,534 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-03-15 12:51:14,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked.
[2022-03-15 12:51:14,618 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:14,932 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-03-15 12:51:14,959 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:51:14,959 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-03-15 12:51:14,967 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:51:14,967 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-03-15 12:51:14,971 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-03-15 12:51:15,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked.
[2022-03-15 12:51:15,963 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364666783] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:15,963 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:15,964 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53
[2022-03-15 12:51:15,964 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132484512]
[2022-03-15 12:51:15,964 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:15,965 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2022-03-15 12:51:15,965 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:15,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2022-03-15 12:51:15,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2297, Unknown=1, NotChecked=100, Total=2756
[2022-03-15 12:51:15,966 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-03-15 12:51:24,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:24,113 INFO  L93              Difference]: Finished difference Result 23411 states and 53779 transitions.
[2022-03-15 12:51:24,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. 
[2022-03-15 12:51:24,131 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-03-15 12:51:24,132 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:24,175 INFO  L225             Difference]: With dead ends: 23411
[2022-03-15 12:51:24,175 INFO  L226             Difference]: Without dead ends: 23411
[2022-03-15 12:51:24,185 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 1417 GetRequests, 1171 SyntacticMatches, 20 SemanticMatches, 226 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20671 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10669, Invalid=40636, Unknown=1, NotChecked=450, Total=51756
[2022-03-15 12:51:24,187 INFO  L933         BasicCegarLoop]: 252 mSDtfsCounter, 14625 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time
[2022-03-15 12:51:24,188 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.0s Time]
[2022-03-15 12:51:24,215 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23411 states.
[2022-03-15 12:51:24,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23411 to 19980.
[2022-03-15 12:51:24,569 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-03-15 12:51:24,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19980 states to 19980 states and 45845 transitions.
[2022-03-15 12:51:24,611 INFO  L78                 Accepts]: Start accepts. Automaton has 19980 states and 45845 transitions. Word has length 597
[2022-03-15 12:51:24,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:24,611 INFO  L470      AbstractCegarLoop]: Abstraction has 19980 states and 45845 transitions.
[2022-03-15 12:51:24,611 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-03-15 12:51:24,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 19980 states and 45845 transitions.
[2022-03-15 12:51:24,651 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 657
[2022-03-15 12:51:24,651 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:24,652 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-03-15 12:51:24,683 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2022-03-15 12:51:24,867 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-03-15 12:51:24,868 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-03-15 12:51:24,868 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:24,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -681457465, now seen corresponding path program 1 times
[2022-03-15 12:51:24,868 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:24,868 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137619267]
[2022-03-15 12:51:24,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:24,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:24,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:25,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:25,444 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:25,444 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137619267]
[2022-03-15 12:51:25,444 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137619267] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:25,444 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745162097]
[2022-03-15 12:51:25,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:25,445 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:25,445 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:25,449 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-03-15 12:51:25,451 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-03-15 12:51:25,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:25,717 INFO  L263         TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core
[2022-03-15 12:51:25,725 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:26,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:26,648 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:27,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-03-15 12:51:27,472 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [745162097] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:27,472 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:27,472 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43
[2022-03-15 12:51:27,472 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900653646]
[2022-03-15 12:51:27,472 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:27,475 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2022-03-15 12:51:27,476 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:27,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2022-03-15 12:51:27,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806
[2022-03-15 12:51:27,476 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-03-15 12:51:28,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:28,357 INFO  L93              Difference]: Finished difference Result 24732 states and 56741 transitions.
[2022-03-15 12:51:28,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. 
[2022-03-15 12:51:28,357 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-03-15 12:51:28,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:28,411 INFO  L225             Difference]: With dead ends: 24732
[2022-03-15 12:51:28,412 INFO  L226             Difference]: Without dead ends: 24732
[2022-03-15 12:51:28,412 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1303 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2044, Invalid=4436, Unknown=0, NotChecked=0, Total=6480
[2022-03-15 12:51:28,413 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-03-15 12:51:28,413 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-03-15 12:51:28,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24732 states.
[2022-03-15 12:51:28,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24732 to 24732.
[2022-03-15 12:51:28,804 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-03-15 12:51:28,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24732 states to 24732 states and 56741 transitions.
[2022-03-15 12:51:28,845 INFO  L78                 Accepts]: Start accepts. Automaton has 24732 states and 56741 transitions. Word has length 656
[2022-03-15 12:51:28,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:28,846 INFO  L470      AbstractCegarLoop]: Abstraction has 24732 states and 56741 transitions.
[2022-03-15 12:51:28,846 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-03-15 12:51:28,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 24732 states and 56741 transitions.
[2022-03-15 12:51:28,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 789
[2022-03-15 12:51:28,889 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:28,889 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-03-15 12:51:28,907 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-03-15 12:51:29,103 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-03-15 12:51:29,104 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-03-15 12:51:29,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:29,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 129194109, now seen corresponding path program 2 times
[2022-03-15 12:51:29,104 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:29,104 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99935273]
[2022-03-15 12:51:29,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:29,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:29,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:29,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked.
[2022-03-15 12:51:29,873 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:29,873 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99935273]
[2022-03-15 12:51:29,873 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99935273] provided 1 perfect and 0 imperfect interpolant sequences
[2022-03-15 12:51:29,873 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-03-15 12:51:29,873 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-03-15 12:51:29,873 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325656861]
[2022-03-15 12:51:29,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-03-15 12:51:29,874 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-03-15 12:51:29,874 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:29,874 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-03-15 12:51:29,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240
[2022-03-15 12:51:29,874 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-03-15 12:51:30,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:51:30,384 INFO  L93              Difference]: Finished difference Result 24603 states and 56488 transitions.
[2022-03-15 12:51:30,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-03-15 12:51:30,384 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-03-15 12:51:30,385 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:51:30,426 INFO  L225             Difference]: With dead ends: 24603
[2022-03-15 12:51:30,426 INFO  L226             Difference]: Without dead ends: 24603
[2022-03-15 12:51:30,426 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702
[2022-03-15 12:51:30,426 INFO  L933         BasicCegarLoop]: 191 mSDtfsCounter, 760 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-15 12:51:30,427 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-03-15 12:51:30,452 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24603 states.
[2022-03-15 12:51:30,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 24590.
[2022-03-15 12:51:30,855 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-03-15 12:51:30,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24590 states to 24590 states and 56457 transitions.
[2022-03-15 12:51:30,895 INFO  L78                 Accepts]: Start accepts. Automaton has 24590 states and 56457 transitions. Word has length 788
[2022-03-15 12:51:30,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:51:30,895 INFO  L470      AbstractCegarLoop]: Abstraction has 24590 states and 56457 transitions.
[2022-03-15 12:51:30,895 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-03-15 12:51:30,895 INFO  L276                IsEmpty]: Start isEmpty. Operand 24590 states and 56457 transitions.
[2022-03-15 12:51:30,924 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 793
[2022-03-15 12:51:30,924 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:51:30,925 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-03-15 12:51:30,925 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-03-15 12:51:30,925 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-03-15 12:51:30,926 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:51:30,926 INFO  L85        PathProgramCache]: Analyzing trace with hash -311280536, now seen corresponding path program 3 times
[2022-03-15 12:51:30,926 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:51:30,926 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235980758]
[2022-03-15 12:51:30,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:51:30,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:51:31,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:51:32,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 947 proven. 20 refuted. 0 times theorem prover too weak. 4923 trivial. 0 not checked.
[2022-03-15 12:51:32,062 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:51:32,062 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235980758]
[2022-03-15 12:51:32,062 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235980758] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:51:32,062 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143382264]
[2022-03-15 12:51:32,062 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-03-15 12:51:32,063 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:51:32,063 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:51:32,076 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-03-15 12:51:32,076 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-03-15 12:51:32,421 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2022-03-15 12:51:32,422 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-03-15 12:51:32,426 INFO  L263         TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 53 conjunts are in the unsatisfiable core
[2022-03-15 12:51:32,437 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:51:34,649 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-03-15 12:51:34,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:51:34,709 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-03-15 12:51:34,885 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:51:34,890 INFO  L353             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2022-03-15 12:51:34,891 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-03-15 12:51:34,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:51:34,937 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-03-15 12:51:35,066 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-03-15 12:51:35,128 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:51:35,128 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-03-15 12:51:35,273 INFO  L353             Elim1Store]: treesize reduction 69, result has 15.9 percent of original size
[2022-03-15 12:51:35,273 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-03-15 12:51:35,317 INFO  L353             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2022-03-15 12:51:35,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 1 case distinctions, treesize of input 23 treesize of output 22
[2022-03-15 12:51:35,336 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-03-15 12:51:35,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked.
[2022-03-15 12:51:35,420 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:51:47,708 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-03-15 12:51:47,737 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-03-15 12:51:47,747 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-03-15 12:51:47,756 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-03-15 12:51:47,800 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-03-15 12:51:47,836 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-03-15 12:51:47,861 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-03-15 12:51:47,907 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-03-15 12:51:47,964 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-03-15 12:51:48,124 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-03-15 12:51:48,218 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:51:48,218 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-03-15 12:51:48,225 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:51:48,225 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-03-15 12:51:48,229 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-03-15 12:51:48,232 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:51:48,234 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-03-15 12:51:48,409 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-03-15 12:51:48,583 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:51:48,583 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-03-15 12:51:49,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 411 refuted. 0 times theorem prover too weak. 4318 trivial. 698 not checked.
[2022-03-15 12:51:49,672 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143382264] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:51:49,672 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:51:49,672 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 21] total 59
[2022-03-15 12:51:49,673 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239124983]
[2022-03-15 12:51:49,673 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:51:49,674 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2022-03-15 12:51:49,675 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:51:49,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2022-03-15 12:51:49,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2068, Unknown=10, NotChecked=1030, Total=3422
[2022-03-15 12:51:49,675 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-03-15 12:51:51,704 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-03-15 12:51:52,166 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-03-15 12:51:52,740 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-03-15 12:51:53,220 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-03-15 12:51:55,280 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-03-15 12:51:57,194 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-03-15 12:51:57,816 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-03-15 12:51:58,219 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-03-15 12:51:58,716 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-03-15 12:51:59,171 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-03-15 12:51:59,621 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-03-15 12:52:01,630 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-03-15 12:52:02,573 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-03-15 12:52:03,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:52:03,883 INFO  L93              Difference]: Finished difference Result 135976 states and 316700 transitions.
[2022-03-15 12:52:03,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. 
[2022-03-15 12:52:03,883 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-03-15 12:52:03,883 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:52:04,341 INFO  L225             Difference]: With dead ends: 135976
[2022-03-15 12:52:04,341 INFO  L226             Difference]: Without dead ends: 135976
[2022-03-15 12:52:04,342 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1554 SyntacticMatches, 17 SemanticMatches, 131 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=2204, Invalid=9855, Unknown=23, NotChecked=5474, Total=17556
[2022-03-15 12:52:04,344 INFO  L933         BasicCegarLoop]: 532 mSDtfsCounter, 5016 mSDsluCounter, 13050 mSDsCounter, 0 mSdLazyCounter, 3068 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time
[2022-03-15 12:52:04,344 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.4s Time]
[2022-03-15 12:52:04,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135976 states.
[2022-03-15 12:52:05,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135976 to 58018.
[2022-03-15 12:52:05,865 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-03-15 12:52:05,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58018 states to 58018 states and 134691 transitions.
[2022-03-15 12:52:05,995 INFO  L78                 Accepts]: Start accepts. Automaton has 58018 states and 134691 transitions. Word has length 792
[2022-03-15 12:52:05,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:52:05,996 INFO  L470      AbstractCegarLoop]: Abstraction has 58018 states and 134691 transitions.
[2022-03-15 12:52:05,996 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-03-15 12:52:05,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 58018 states and 134691 transitions.
[2022-03-15 12:52:06,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 793
[2022-03-15 12:52:06,253 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:52:06,254 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-03-15 12:52:06,274 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-03-15 12:52:06,471 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-03-15 12:52:06,473 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-03-15 12:52:06,474 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:52:06,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 574269212, now seen corresponding path program 4 times
[2022-03-15 12:52:06,474 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:52:06,474 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708833420]
[2022-03-15 12:52:06,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:52:06,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:52:06,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:52:08,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 3413 proven. 178 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked.
[2022-03-15 12:52:08,186 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:52:08,186 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708833420]
[2022-03-15 12:52:08,186 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708833420] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:52:08,186 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558641925]
[2022-03-15 12:52:08,186 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-03-15 12:52:08,186 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:52:08,187 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:52:08,199 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-03-15 12:52:08,200 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-03-15 12:52:15,029 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-03-15 12:52:15,029 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-03-15 12:52:15,043 INFO  L263         TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 63 conjunts are in the unsatisfiable core
[2022-03-15 12:52:15,053 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:52:16,026 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-03-15 12:52:16,082 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:16,083 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-03-15 12:52:16,275 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:52:16,281 INFO  L353             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2022-03-15 12:52:16,282 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-03-15 12:52:16,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:16,327 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-03-15 12:52:16,469 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-03-15 12:52:16,539 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:16,540 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-03-15 12:52:16,687 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:52:16,694 INFO  L353             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2022-03-15 12:52:16,694 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-03-15 12:52:16,737 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:16,738 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-03-15 12:52:16,756 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-03-15 12:52:17,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 2706 proven. 118 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked.
[2022-03-15 12:52:17,315 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:52:41,053 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-03-15 12:52:41,116 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-03-15 12:52:41,127 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-03-15 12:52:41,139 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-03-15 12:52:41,200 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-03-15 12:52:41,245 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-03-15 12:52:41,278 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-03-15 12:52:41,341 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-03-15 12:52:41,418 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-03-15 12:52:41,600 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-03-15 12:52:41,720 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:52:41,721 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-03-15 12:52:41,728 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:52:41,729 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-03-15 12:52:41,735 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-03-15 12:52:41,747 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-03-15 12:52:41,798 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-03-15 12:52:41,904 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:52:41,904 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-03-15 12:52:42,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 2563 proven. 89 refuted. 0 times theorem prover too weak. 3072 trivial. 166 not checked.
[2022-03-15 12:52:42,420 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [558641925] provided 0 perfect and 2 imperfect interpolant sequences
[2022-03-15 12:52:42,420 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-03-15 12:52:42,421 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 22] total 68
[2022-03-15 12:52:42,421 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113993559]
[2022-03-15 12:52:42,421 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-03-15 12:52:42,422 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 68 states
[2022-03-15 12:52:42,422 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-03-15 12:52:42,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants.
[2022-03-15 12:52:42,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2903, Unknown=38, NotChecked=1210, Total=4556
[2022-03-15 12:52:42,423 INFO  L87              Difference]: Start difference. First operand 58018 states and 134691 transitions. Second operand  has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 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-03-15 12:52:43,515 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| |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) (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-03-15 12:52:43,986 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-03-15 12:52:44,520 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-03-15 12:52:45,090 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-03-15 12:52:47,128 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-03-15 12:52:48,126 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|) (<= (select .cse0 84) 2) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* .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-03-15 12:52:48,441 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)))))) (<= (select .cse0 84) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false
[2022-03-15 12:52:49,331 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-03-15 12:52:49,934 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-03-15 12:52:51,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-03-15 12:52:51,579 INFO  L93              Difference]: Finished difference Result 174095 states and 407878 transitions.
[2022-03-15 12:52:51,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2022-03-15 12:52:51,579 INFO  L78                 Accepts]: Start accepts. Automaton has  has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 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-03-15 12:52:51,580 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-03-15 12:52:52,022 INFO  L225             Difference]: With dead ends: 174095
[2022-03-15 12:52:52,023 INFO  L226             Difference]: Without dead ends: 174095
[2022-03-15 12:52:52,040 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1578 SyntacticMatches, 15 SemanticMatches, 107 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=1185, Invalid=6854, Unknown=47, NotChecked=3686, Total=11772
[2022-03-15 12:52:52,043 INFO  L933         BasicCegarLoop]: 640 mSDtfsCounter, 4248 mSDsluCounter, 15831 mSDsCounter, 0 mSdLazyCounter, 3394 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4248 SdHoareTripleChecker+Valid, 16310 SdHoareTripleChecker+Invalid, 10654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7138 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-03-15 12:52:52,043 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [4248 Valid, 16310 Invalid, 10654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3394 Invalid, 0 Unknown, 7138 Unchecked, 1.3s Time]
[2022-03-15 12:52:52,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 174095 states.
[2022-03-15 12:52:54,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 174095 to 93381.
[2022-03-15 12:52:54,224 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-03-15 12:52:54,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 225155 transitions.
[2022-03-15 12:52:54,636 INFO  L78                 Accepts]: Start accepts. Automaton has 93381 states and 225155 transitions. Word has length 792
[2022-03-15 12:52:54,637 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-03-15 12:52:54,637 INFO  L470      AbstractCegarLoop]: Abstraction has 93381 states and 225155 transitions.
[2022-03-15 12:52:54,637 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 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-03-15 12:52:54,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 93381 states and 225155 transitions.
[2022-03-15 12:52:55,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 794
[2022-03-15 12:52:55,053 INFO  L506         BasicCegarLoop]: Found error trace
[2022-03-15 12:52:55,053 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-03-15 12:52:55,077 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-03-15 12:52:55,259 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-03-15 12:52:55,260 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-03-15 12:52:55,260 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-03-15 12:52:55,260 INFO  L85        PathProgramCache]: Analyzing trace with hash 1148069001, now seen corresponding path program 1 times
[2022-03-15 12:52:55,261 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-03-15 12:52:55,261 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553398615]
[2022-03-15 12:52:55,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:52:55,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-03-15 12:52:55,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:52:57,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 3413 proven. 178 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked.
[2022-03-15 12:52:57,033 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-03-15 12:52:57,033 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553398615]
[2022-03-15 12:52:57,033 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553398615] provided 0 perfect and 1 imperfect interpolant sequences
[2022-03-15 12:52:57,033 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497627471]
[2022-03-15 12:52:57,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-03-15 12:52:57,033 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-03-15 12:52:57,033 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-03-15 12:52:57,035 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-03-15 12:52:57,035 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-03-15 12:52:57,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-03-15 12:52:57,397 INFO  L263         TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 59 conjunts are in the unsatisfiable core
[2022-03-15 12:52:57,428 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-03-15 12:52:58,796 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-03-15 12:52:58,845 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:58,850 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-03-15 12:52:59,022 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:52:59,031 INFO  L353             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2022-03-15 12:52:59,031 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-03-15 12:52:59,090 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:59,091 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-03-15 12:52:59,202 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-03-15 12:52:59,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:59,281 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-03-15 12:52:59,424 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-03-15 12:52:59,430 INFO  L353             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2022-03-15 12:52:59,430 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-03-15 12:52:59,468 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-03-15 12:52:59,469 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-03-15 12:52:59,500 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-03-15 12:52:59,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 5890 backedges. 3292 proven. 302 refuted. 0 times theorem prover too weak. 2296 trivial. 0 not checked.
[2022-03-15 12:52:59,787 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-03-15 12:53:21,953 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-03-15 12:53:22,009 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-03-15 12:53:22,020 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-03-15 12:53:22,030 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-03-15 12:53:22,084 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-03-15 12:53:22,142 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-03-15 12:53:22,174 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-03-15 12:53:22,225 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-03-15 12:53:22,308 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-03-15 12:53:22,474 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-03-15 12:53:22,590 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:53:22,591 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-03-15 12:53:22,597 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-03-15 12:53:22,598 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-03-15 12:53:22,602 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-03-15 12:53:22,606 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-03-15 12:53:22,636 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-03-15 13:05:23,611 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-03-15 13:05:23,614 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-03-15 13:05:23,664 WARN  L244               SmtUtils]: Removed 2 from assertion stack
[2022-03-15 13:05:23,666 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2022-03-15 13:05:23,687 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-03-15 13:05:23,887 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-03-15 13:05:23,888 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 104ms..
[2022-03-15 13:05:23,896 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2022-03-15 13:05:23,896 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining)
[2022-03-15 13:05:23,897 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining)
[2022-03-15 13:05:23,897 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2022-03-15 13:05:23,899 INFO  L732         BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1]
[2022-03-15 13:05:23,902 INFO  L230   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-03-15 13:05:23,903 INFO  L180   ceAbstractionStarter]: Computing trace abstraction results
[2022-03-15 13:05:23,904 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:05:23 BasicIcfg
[2022-03-15 13:05:23,904 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-03-15 13:05:23,905 INFO  L158              Benchmark]: Toolchain (without parser) took 861758.15ms. Allocated memory was 182.5MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 126.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,905 INFO  L158              Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-03-15 13:05:23,906 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 379.08ms. Allocated memory is still 182.5MB. Free memory was 126.5MB in the beginning and 136.8MB in the end (delta: -10.3MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,907 INFO  L158              Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 134.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,911 INFO  L158              Benchmark]: Boogie Preprocessor took 34.52ms. Allocated memory is still 182.5MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,911 INFO  L158              Benchmark]: RCFGBuilder took 446.34ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 112.7MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,912 INFO  L158              Benchmark]: TraceAbstraction took 860833.03ms. Allocated memory was 182.5MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 112.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB.
[2022-03-15 13:05:23,917 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.09ms. Allocated memory is still 182.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 379.08ms. Allocated memory is still 182.5MB. Free memory was 126.5MB in the beginning and 136.8MB in the end (delta: -10.3MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 134.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 34.52ms. Allocated memory is still 182.5MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 446.34ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 112.7MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
 * TraceAbstraction took 860833.03ms. Allocated memory was 182.5MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 112.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.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 104ms..
  - 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 104ms..
  - 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 104ms..
  - 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 104ms..
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 860.7s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31140 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31140 mSDsluCounter, 46619 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17153 IncrementalHoareTripleChecker+Unchecked, 43660 mSDsCounter, 1588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9151 IncrementalHoareTripleChecker+Invalid, 27892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1588 mSolverCounterUnsat, 3456 mSDtfsCounter, 9151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7805 GetRequests, 7062 SyntacticMatches, 53 SemanticMatches, 690 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 30463 ImplicationChecksByTransitivity, 64.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93381occurred in iteration=13, InterpolantAutomatonStates: 485, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 163026 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 56.8s InterpolantComputationTime, 8588 NumberOfCodeBlocks, 7618 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12134 ConstructedInterpolants, 105 QuantifiedInterpolants, 48051 SizeOfPredicates, 109 NumberOfNonLiveVariables, 5657 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 44996/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