/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 22:23:46,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 22:23:46,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 22:23:46,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 22:23:46,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 22:23:46,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 22:23:46,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 22:23:46,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 22:23:46,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 22:23:46,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 22:23:46,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 22:23:46,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 22:23:46,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 22:23:46,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 22:23:46,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 22:23:46,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 22:23:46,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 22:23:46,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 22:23:46,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 22:23:46,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 22:23:46,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 22:23:46,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 22:23:46,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 22:23:46,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 22:23:46,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 22:23:46,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 22:23:46,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 22:23:46,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 22:23:46,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 22:23:46,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 22:23:46,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 22:23:46,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 22:23:46,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 22:23:46,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 22:23:46,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 22:23:46,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 22:23:46,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 22:23:46,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 22:23:46,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 22:23:46,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 22:23:46,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 22:23:46,435 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-01-17 22:23:46,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 22:23:46,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 22:23:46,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 22:23:46,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 22:23:46,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 22:23:46,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 22:23:46,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 22:23:46,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 22:23:46,453 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 22:23:46,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 22:23:46,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 22:23:46,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 22:23:46,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 22:23:46,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 22:23:46,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 22:23:46,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 22:23:46,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 22:23:46,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 22:23:46,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 22:23:46,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 22:23:46,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 22:23:46,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 22:23:46,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 22:23:46,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 22:23:46,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 22:23:46,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 22:23:46,461 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 22:23:46,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 22:23:46,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-17 22:23:46,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 22:23:46,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 22:23:46,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 22:23:46,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 22:23:46,702 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 22:23:46,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-01-17 22:23:46,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea97d276/baae88c580ce427baecc5daaee1d835f/FLAGe1a5e61c0 [2022-01-17 22:23:47,199 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 22:23:47,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-01-17 22:23:47,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea97d276/baae88c580ce427baecc5daaee1d835f/FLAGe1a5e61c0 [2022-01-17 22:23:47,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea97d276/baae88c580ce427baecc5daaee1d835f [2022-01-17 22:23:47,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 22:23:47,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 22:23:47,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 22:23:47,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 22:23:47,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 22:23:47,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 10:23:47" (1/1) ... [2022-01-17 22:23:47,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764aee0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:47, skipping insertion in model container [2022-01-17 22:23:47,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 10:23:47" (1/1) ... [2022-01-17 22:23:47,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 22:23:47,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 22:23:48,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-01-17 22:23:48,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-01-17 22:23:48,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 22:23:48,176 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 22:23:48,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-01-17 22:23:48,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-01-17 22:23:48,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 22:23:48,313 INFO L208 MainTranslator]: Completed translation [2022-01-17 22:23:48,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48 WrapperNode [2022-01-17 22:23:48,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 22:23:48,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 22:23:48,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 22:23:48,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 22:23:48,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,407 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-01-17 22:23:48,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 22:23:48,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 22:23:48,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 22:23:48,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 22:23:48,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 22:23:48,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 22:23:48,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 22:23:48,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 22:23:48,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (1/1) ... [2022-01-17 22:23:48,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 22:23:48,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:23:48,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-17 22:23:48,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-17 22:23:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-17 22:23:48,534 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-17 22:23:48,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 22:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 22:23:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 22:23:48,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 22:23:48,537 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-17 22:23:48,649 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 22:23:48,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 22:23:48,950 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 22:23:48,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 22:23:48,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-17 22:23:48,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 10:23:48 BoogieIcfgContainer [2022-01-17 22:23:48,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 22:23:48,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 22:23:48,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 22:23:48,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 22:23:48,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 10:23:47" (1/3) ... [2022-01-17 22:23:48,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526612be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 10:23:48, skipping insertion in model container [2022-01-17 22:23:48,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:23:48" (2/3) ... [2022-01-17 22:23:48,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526612be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 10:23:48, skipping insertion in model container [2022-01-17 22:23:48,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 10:23:48" (3/3) ... [2022-01-17 22:23:48,969 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-01-17 22:23:48,975 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 22:23:48,976 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 22:23:48,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-17 22:23:48,976 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 22:23:49,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,069 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,072 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,108 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,109 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,110 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,115 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,118 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,119 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,120 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,121 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,122 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,126 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,126 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,126 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,126 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,126 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,127 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,127 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,127 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,127 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,127 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,128 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,128 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,128 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,128 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,128 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,133 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:23:49,147 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-17 22:23:49,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 22:23:49,191 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-17 22:23:49,192 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-17 22:23:49,204 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 225 places, 231 transitions, 478 flow [2022-01-17 22:23:49,638 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-17 22:23:49,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:49,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:49,706 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-01-17 22:23:49,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110274517] [2022-01-17 22:23:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:49,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:49,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110274517] [2022-01-17 22:23:49,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110274517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:23:49,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:23:49,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-17 22:23:49,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938238104] [2022-01-17 22:23:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:23:49,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-17 22:23:49,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-17 22:23:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-17 22:23:50,060 INFO L87 Difference]: Start difference. First operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:50,301 INFO L93 Difference]: Finished difference Result 14373 states and 40204 transitions. [2022-01-17 22:23:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-17 22:23:50,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-01-17 22:23:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:50,411 INFO L225 Difference]: With dead ends: 14373 [2022-01-17 22:23:50,411 INFO L226 Difference]: Without dead ends: 14373 [2022-01-17 22:23:50,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-17 22:23:50,415 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:50,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:23:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2022-01-17 22:23:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14373. [2022-01-17 22:23:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14373 states, 14372 states have (on average 2.7973838018369053) internal successors, (40204), 14372 states have internal predecessors, (40204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 40204 transitions. [2022-01-17 22:23:50,972 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 40204 transitions. Word has length 58 [2022-01-17 22:23:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:50,974 INFO L470 AbstractCegarLoop]: Abstraction has 14373 states and 40204 transitions. [2022-01-17 22:23:50,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 40204 transitions. [2022-01-17 22:23:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-17 22:23:51,148 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:51,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:51,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 22:23:51,149 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-01-17 22:23:51,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:51,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232320963] [2022-01-17 22:23:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:51,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:51,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:51,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232320963] [2022-01-17 22:23:51,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232320963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:23:51,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:23:51,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-17 22:23:51,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610246600] [2022-01-17 22:23:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:23:51,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-17 22:23:51,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:51,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-17 22:23:51,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-17 22:23:51,630 INFO L87 Difference]: Start difference. First operand 14373 states and 40204 transitions. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:52,161 INFO L93 Difference]: Finished difference Result 14370 states and 40200 transitions. [2022-01-17 22:23:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-17 22:23:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-01-17 22:23:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:52,233 INFO L225 Difference]: With dead ends: 14370 [2022-01-17 22:23:52,233 INFO L226 Difference]: Without dead ends: 14370 [2022-01-17 22:23:52,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-01-17 22:23:52,235 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 563 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:52,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1055 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 22:23:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14370 states. [2022-01-17 22:23:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14370 to 14370. [2022-01-17 22:23:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14370 states, 14369 states have (on average 2.79768947038764) internal successors, (40200), 14369 states have internal predecessors, (40200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14370 states to 14370 states and 40200 transitions. [2022-01-17 22:23:52,683 INFO L78 Accepts]: Start accepts. Automaton has 14370 states and 40200 transitions. Word has length 120 [2022-01-17 22:23:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:52,684 INFO L470 AbstractCegarLoop]: Abstraction has 14370 states and 40200 transitions. [2022-01-17 22:23:52,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14370 states and 40200 transitions. [2022-01-17 22:23:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-17 22:23:52,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:52,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:52,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 22:23:52,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-01-17 22:23:52,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:52,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338714029] [2022-01-17 22:23:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:52,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:52,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338714029] [2022-01-17 22:23:52,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338714029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:23:52,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:23:52,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-17 22:23:52,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740838005] [2022-01-17 22:23:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:23:52,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 22:23:52,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:52,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 22:23:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:52,789 INFO L87 Difference]: Start difference. First operand 14370 states and 40200 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:52,895 INFO L93 Difference]: Finished difference Result 2713 states and 6565 transitions. [2022-01-17 22:23:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 22:23:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-17 22:23:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:52,902 INFO L225 Difference]: With dead ends: 2713 [2022-01-17 22:23:52,902 INFO L226 Difference]: Without dead ends: 2594 [2022-01-17 22:23:52,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:52,903 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:52,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:23:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-01-17 22:23:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594. [2022-01-17 22:23:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 2.42421905129194) internal successors, (6286), 2593 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 6286 transitions. [2022-01-17 22:23:52,979 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 6286 transitions. Word has length 121 [2022-01-17 22:23:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:52,981 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 6286 transitions. [2022-01-17 22:23:52,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 6286 transitions. [2022-01-17 22:23:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-17 22:23:52,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:52,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:52,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 22:23:52,993 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash 139355698, now seen corresponding path program 1 times [2022-01-17 22:23:52,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:52,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014692341] [2022-01-17 22:23:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:52,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:53,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014692341] [2022-01-17 22:23:53,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014692341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:23:53,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:23:53,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-17 22:23:53,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231501518] [2022-01-17 22:23:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:23:53,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 22:23:53,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 22:23:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:53,101 INFO L87 Difference]: Start difference. First operand 2594 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:53,140 INFO L93 Difference]: Finished difference Result 3530 states and 8580 transitions. [2022-01-17 22:23:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 22:23:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-17 22:23:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:53,149 INFO L225 Difference]: With dead ends: 3530 [2022-01-17 22:23:53,150 INFO L226 Difference]: Without dead ends: 3530 [2022-01-17 22:23:53,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:53,158 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:53,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 392 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:23:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2022-01-17 22:23:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2620. [2022-01-17 22:23:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2619 states have (on average 2.424207712867507) internal successors, (6349), 2619 states have internal predecessors, (6349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 6349 transitions. [2022-01-17 22:23:53,265 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 6349 transitions. Word has length 131 [2022-01-17 22:23:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:53,266 INFO L470 AbstractCegarLoop]: Abstraction has 2620 states and 6349 transitions. [2022-01-17 22:23:53,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 6349 transitions. [2022-01-17 22:23:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-17 22:23:53,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:53,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:53,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 22:23:53,273 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 863459016, now seen corresponding path program 1 times [2022-01-17 22:23:53,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:53,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162858741] [2022-01-17 22:23:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:53,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:53,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162858741] [2022-01-17 22:23:53,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162858741] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:23:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179603119] [2022-01-17 22:23:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:53,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:23:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:23:53,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:23:53,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-17 22:23:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:53,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-17 22:23:53,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:23:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:53,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:23:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:54,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179603119] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:23:54,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:23:54,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-17 22:23:54,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098612870] [2022-01-17 22:23:54,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:23:54,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-17 22:23:54,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-17 22:23:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-17 22:23:54,070 INFO L87 Difference]: Start difference. First operand 2620 states and 6349 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:54,171 INFO L93 Difference]: Finished difference Result 4544 states and 11063 transitions. [2022-01-17 22:23:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 22:23:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-17 22:23:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:54,184 INFO L225 Difference]: With dead ends: 4544 [2022-01-17 22:23:54,184 INFO L226 Difference]: Without dead ends: 4544 [2022-01-17 22:23:54,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-17 22:23:54,185 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-01-17 22:23:54,186 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-01-17 22:23:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2022-01-17 22:23:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4544. [2022-01-17 22:23:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4543 states have (on average 2.4351749944970282) internal successors, (11063), 4543 states have internal predecessors, (11063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 11063 transitions. [2022-01-17 22:23:54,292 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 11063 transitions. Word has length 162 [2022-01-17 22:23:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:54,293 INFO L470 AbstractCegarLoop]: Abstraction has 4544 states and 11063 transitions. [2022-01-17 22:23:54,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 11063 transitions. [2022-01-17 22:23:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-17 22:23:54,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:54,306 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:54,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-17 22:23:54,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:23:54,520 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1615060600, now seen corresponding path program 2 times [2022-01-17 22:23:54,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114804712] [2022-01-17 22:23:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:54,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-17 22:23:54,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:54,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114804712] [2022-01-17 22:23:54,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114804712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:23:54,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:23:54,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-17 22:23:54,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058964953] [2022-01-17 22:23:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:23:54,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 22:23:54,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 22:23:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:54,658 INFO L87 Difference]: Start difference. First operand 4544 states and 11063 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:54,688 INFO L93 Difference]: Finished difference Result 3344 states and 7707 transitions. [2022-01-17 22:23:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 22:23:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2022-01-17 22:23:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:54,697 INFO L225 Difference]: With dead ends: 3344 [2022-01-17 22:23:54,697 INFO L226 Difference]: Without dead ends: 3312 [2022-01-17 22:23:54,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 22:23:54,698 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 87 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:54,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:23:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2022-01-17 22:23:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2022-01-17 22:23:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3311 states have (on average 2.303533675626699) internal successors, (7627), 3311 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 7627 transitions. [2022-01-17 22:23:54,757 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 7627 transitions. Word has length 224 [2022-01-17 22:23:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:54,757 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 7627 transitions. [2022-01-17 22:23:54,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 7627 transitions. [2022-01-17 22:23:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-17 22:23:54,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:54,766 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:54,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 22:23:54,767 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:54,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash -320685280, now seen corresponding path program 1 times [2022-01-17 22:23:54,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:54,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446883853] [2022-01-17 22:23:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:54,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:54,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:54,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446883853] [2022-01-17 22:23:54,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446883853] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:23:54,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560390468] [2022-01-17 22:23:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:54,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:23:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:23:54,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:23:54,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-17 22:23:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:55,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-17 22:23:55,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:23:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:55,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:23:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:55,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560390468] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:23:55,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:23:55,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-17 22:23:55,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154984839] [2022-01-17 22:23:55,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:23:55,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-17 22:23:55,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-17 22:23:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-17 22:23:55,823 INFO L87 Difference]: Start difference. First operand 3312 states and 7627 transitions. Second operand has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:56,062 INFO L93 Difference]: Finished difference Result 5976 states and 13767 transitions. [2022-01-17 22:23:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-17 22:23:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-01-17 22:23:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:56,077 INFO L225 Difference]: With dead ends: 5976 [2022-01-17 22:23:56,077 INFO L226 Difference]: Without dead ends: 5976 [2022-01-17 22:23:56,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-01-17 22:23:56,078 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 648 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:56,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 2396 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 22:23:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2022-01-17 22:23:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5976. [2022-01-17 22:23:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5975 states have (on average 2.3041004184100418) internal successors, (13767), 5975 states have internal predecessors, (13767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 13767 transitions. [2022-01-17 22:23:56,211 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 13767 transitions. Word has length 225 [2022-01-17 22:23:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:56,211 INFO L470 AbstractCegarLoop]: Abstraction has 5976 states and 13767 transitions. [2022-01-17 22:23:56,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 13767 transitions. [2022-01-17 22:23:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2022-01-17 22:23:56,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:56,227 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:56,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-17 22:23:56,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-17 22:23:56,440 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 185124256, now seen corresponding path program 2 times [2022-01-17 22:23:56,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:56,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821270352] [2022-01-17 22:23:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:56,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:23:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:56,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:23:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821270352] [2022-01-17 22:23:56,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821270352] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:23:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474929651] [2022-01-17 22:23:56,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-17 22:23:56,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:23:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:23:56,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:23:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-17 22:23:56,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-17 22:23:56,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:23:57,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-17 22:23:57,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:23:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:57,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:23:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:23:58,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474929651] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:23:58,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:23:58,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-01-17 22:23:58,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893554491] [2022-01-17 22:23:58,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:23:58,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-17 22:23:58,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:23:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-17 22:23:58,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-17 22:23:58,614 INFO L87 Difference]: Start difference. First operand 5976 states and 13767 transitions. Second operand has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:23:59,332 INFO L93 Difference]: Finished difference Result 11304 states and 26047 transitions. [2022-01-17 22:23:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-17 22:23:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2022-01-17 22:23:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:23:59,361 INFO L225 Difference]: With dead ends: 11304 [2022-01-17 22:23:59,361 INFO L226 Difference]: Without dead ends: 11304 [2022-01-17 22:23:59,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1192, Invalid=2590, Unknown=0, NotChecked=0, Total=3782 [2022-01-17 22:23:59,363 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2055 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 22:23:59,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2055 Valid, 2628 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 22:23:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2022-01-17 22:23:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 11304. [2022-01-17 22:23:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11304 states, 11303 states have (on average 2.3044324515615324) internal successors, (26047), 11303 states have internal predecessors, (26047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11304 states to 11304 states and 26047 transitions. [2022-01-17 22:23:59,600 INFO L78 Accepts]: Start accepts. Automaton has 11304 states and 26047 transitions. Word has length 349 [2022-01-17 22:23:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:23:59,601 INFO L470 AbstractCegarLoop]: Abstraction has 11304 states and 26047 transitions. [2022-01-17 22:23:59,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:23:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 11304 states and 26047 transitions. [2022-01-17 22:23:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2022-01-17 22:23:59,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:23:59,633 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:23:59,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-17 22:23:59,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:23:59,848 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:23:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:23:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2037947040, now seen corresponding path program 3 times [2022-01-17 22:23:59,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:23:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046263574] [2022-01-17 22:23:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:23:59,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:23:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:24:00,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:24:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046263574] [2022-01-17 22:24:00,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046263574] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:24:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644537626] [2022-01-17 22:24:00,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-17 22:24:00,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:00,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:24:00,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:24:00,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-17 22:24:00,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-17 22:24:00,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:24:00,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-17 22:24:00,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:24:03,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-17 22:24:03,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:24:03,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-17 22:24:03,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:24:03,401 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-01-17 22:24:03,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-01-17 22:24:03,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:24:03,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-17 22:24:03,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-17 22:24:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-01-17 22:24:03,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:24:03,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-17 22:24:04,030 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:24:04,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-17 22:24:04,038 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:24:04,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-01-17 22:24:04,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-17 22:24:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-01-17 22:24:05,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644537626] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:24:05,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:24:05,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-01-17 22:24:05,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299412625] [2022-01-17 22:24:05,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:24:05,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-17 22:24:05,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:24:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-17 22:24:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2297, Unknown=1, NotChecked=100, Total=2756 [2022-01-17 22:24:05,072 INFO L87 Difference]: Start difference. First operand 11304 states and 26047 transitions. Second operand has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:24:14,656 INFO L93 Difference]: Finished difference Result 23411 states and 53779 transitions. [2022-01-17 22:24:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-17 22:24:14,656 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2022-01-17 22:24:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:24:14,708 INFO L225 Difference]: With dead ends: 23411 [2022-01-17 22:24:14,708 INFO L226 Difference]: Without dead ends: 23411 [2022-01-17 22:24:14,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1417 GetRequests, 1171 SyntacticMatches, 20 SemanticMatches, 226 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20671 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10669, Invalid=40636, Unknown=1, NotChecked=450, Total=51756 [2022-01-17 22:24:14,722 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 14625 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-01-17 22:24:14,722 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.3s Time] [2022-01-17 22:24:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23411 states. [2022-01-17 22:24:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23411 to 19980. [2022-01-17 22:24:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19980 states, 19979 states have (on average 2.29465939236198) internal successors, (45845), 19979 states have internal predecessors, (45845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19980 states to 19980 states and 45845 transitions. [2022-01-17 22:24:15,137 INFO L78 Accepts]: Start accepts. Automaton has 19980 states and 45845 transitions. Word has length 597 [2022-01-17 22:24:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:24:15,137 INFO L470 AbstractCegarLoop]: Abstraction has 19980 states and 45845 transitions. [2022-01-17 22:24:15,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19980 states and 45845 transitions. [2022-01-17 22:24:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-01-17 22:24:15,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:24:15,187 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:24:15,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-17 22:24:15,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:15,407 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:24:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:24:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -681457465, now seen corresponding path program 1 times [2022-01-17 22:24:15,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:24:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182388766] [2022-01-17 22:24:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:24:15,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:24:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:24:16,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:24:16,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182388766] [2022-01-17 22:24:16,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182388766] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:24:16,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840644994] [2022-01-17 22:24:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:24:16,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:24:16,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:24:16,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-17 22:24:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:16,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-17 22:24:16,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:24:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:24:17,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:24:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:24:18,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840644994] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:24:18,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:24:18,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-01-17 22:24:18,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071223513] [2022-01-17 22:24:18,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:24:18,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-17 22:24:18,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:24:18,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-17 22:24:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-01-17 22:24:18,672 INFO L87 Difference]: Start difference. First operand 19980 states and 45845 transitions. Second operand has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:24:19,720 INFO L93 Difference]: Finished difference Result 24732 states and 56741 transitions. [2022-01-17 22:24:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-17 22:24:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 656 [2022-01-17 22:24:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:24:19,784 INFO L225 Difference]: With dead ends: 24732 [2022-01-17 22:24:19,784 INFO L226 Difference]: Without dead ends: 24732 [2022-01-17 22:24:19,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1303 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2044, Invalid=4436, Unknown=0, NotChecked=0, Total=6480 [2022-01-17 22:24:19,785 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.2s IncrementalHoareTripleChecker+Time [2022-01-17 22:24:19,786 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.2s Time] [2022-01-17 22:24:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24732 states. [2022-01-17 22:24:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24732 to 24732. [2022-01-17 22:24:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24732 states, 24731 states have (on average 2.2943269580688206) internal successors, (56741), 24731 states have internal predecessors, (56741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24732 states to 24732 states and 56741 transitions. [2022-01-17 22:24:20,341 INFO L78 Accepts]: Start accepts. Automaton has 24732 states and 56741 transitions. Word has length 656 [2022-01-17 22:24:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:24:20,343 INFO L470 AbstractCegarLoop]: Abstraction has 24732 states and 56741 transitions. [2022-01-17 22:24:20,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 24732 states and 56741 transitions. [2022-01-17 22:24:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2022-01-17 22:24:20,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:24:20,396 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:24:20,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-17 22:24:20,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-17 22:24:20,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:24:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:24:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 129194109, now seen corresponding path program 2 times [2022-01-17 22:24:20,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:24:20,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285924667] [2022-01-17 22:24:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:24:20,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:24:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked. [2022-01-17 22:24:21,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:24:21,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285924667] [2022-01-17 22:24:21,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285924667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:24:21,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:24:21,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-17 22:24:21,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382204530] [2022-01-17 22:24:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:24:21,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-17 22:24:21,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:24:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-17 22:24:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-01-17 22:24:21,336 INFO L87 Difference]: Start difference. First operand 24732 states and 56741 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:24:21,948 INFO L93 Difference]: Finished difference Result 24603 states and 56488 transitions. [2022-01-17 22:24:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-17 22:24:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 788 [2022-01-17 22:24:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:24:21,993 INFO L225 Difference]: With dead ends: 24603 [2022-01-17 22:24:21,993 INFO L226 Difference]: Without dead ends: 24603 [2022-01-17 22:24:21,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2022-01-17 22:24:21,994 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 760 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 22:24:21,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1234 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 22:24:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2022-01-17 22:24:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 24590. [2022-01-17 22:24:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24590 states, 24589 states have (on average 2.29602667859612) internal successors, (56457), 24589 states have internal predecessors, (56457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24590 states to 24590 states and 56457 transitions. [2022-01-17 22:24:22,489 INFO L78 Accepts]: Start accepts. Automaton has 24590 states and 56457 transitions. Word has length 788 [2022-01-17 22:24:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:24:22,490 INFO L470 AbstractCegarLoop]: Abstraction has 24590 states and 56457 transitions. [2022-01-17 22:24:22,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 24590 states and 56457 transitions. [2022-01-17 22:24:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-01-17 22:24:22,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:24:22,530 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:24:22,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 22:24:22,531 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:24:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:24:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -311280536, now seen corresponding path program 3 times [2022-01-17 22:24:22,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:24:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411374588] [2022-01-17 22:24:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:24:22,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:24:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 947 proven. 20 refuted. 0 times theorem prover too weak. 4923 trivial. 0 not checked. [2022-01-17 22:24:23,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:24:23,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411374588] [2022-01-17 22:24:23,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411374588] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:24:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192954571] [2022-01-17 22:24:23,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-17 22:24:23,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:24:23,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:24:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-17 22:24:24,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-17 22:24:24,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:24:24,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-17 22:24:24,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:24:26,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-17 22:24:27,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:24:27,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-17 22:24:27,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:24:27,243 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-17 22:24:27,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-17 22:24:27,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:24:27,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-17 22:24:27,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-01-17 22:24:27,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:24:27,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-17 22:24:27,740 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-01-17 22:24:27,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2022-01-17 22:24:27,798 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-17 22:24:27,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-17 22:24:27,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-17 22:24:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked. [2022-01-17 22:24:27,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:24:38,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-17 22:24:38,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (not (<= v_ArrVal_1664 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-17 22:24:38,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-17 22:24:38,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-01-17 22:24:38,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664)))) is different from false [2022-01-17 22:24:38,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-01-17 22:24:38,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-01-17 22:24:38,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) is different from false [2022-01-17 22:24:38,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) is different from false [2022-01-17 22:24:38,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) is different from false [2022-01-17 22:24:38,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:24:38,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 90 [2022-01-17 22:24:38,987 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:24:38,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 143 [2022-01-17 22:24:38,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-01-17 22:24:39,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:24:39,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-01-17 22:24:39,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-17 22:24:39,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:24:39,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2022-01-17 22:24:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 411 refuted. 0 times theorem prover too weak. 4318 trivial. 698 not checked. [2022-01-17 22:24:41,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192954571] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:24:41,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:24:41,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 21] total 59 [2022-01-17 22:24:41,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569549668] [2022-01-17 22:24:41,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:24:41,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-17 22:24:41,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:24:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-17 22:24:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2068, Unknown=10, NotChecked=1030, Total=3422 [2022-01-17 22:24:41,025 INFO L87 Difference]: Start difference. First operand 24590 states and 56457 transitions. Second operand has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:43,111 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (or .cse4 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) .cse4 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse5 84) 4) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse5 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:24:43,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:24:44,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse3 84) 4) 4) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:24:44,571 WARN L838 $PredicateComparison]: unable to prove that (and (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:46,647 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-01-17 22:24:48,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:24:49,335 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:24:49,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:50,232 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:50,679 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:51,120 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:53,129 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-01-17 22:24:54,114 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:24:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:24:55,156 INFO L93 Difference]: Finished difference Result 135976 states and 316700 transitions. [2022-01-17 22:24:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-01-17 22:24:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 792 [2022-01-17 22:24:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:24:55,423 INFO L225 Difference]: With dead ends: 135976 [2022-01-17 22:24:55,424 INFO L226 Difference]: Without dead ends: 135976 [2022-01-17 22:24:55,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1554 SyntacticMatches, 17 SemanticMatches, 131 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2204, Invalid=9855, Unknown=23, NotChecked=5474, Total=17556 [2022-01-17 22:24:55,425 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.5s IncrementalHoareTripleChecker+Time [2022-01-17 22:24:55,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5016 Valid, 13449 Invalid, 12643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 3068 Invalid, 0 Unknown, 9253 Unchecked, 1.5s Time] [2022-01-17 22:24:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135976 states. [2022-01-17 22:24:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135976 to 58018. [2022-01-17 22:24:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58018 states, 58017 states have (on average 2.3215781581260666) internal successors, (134691), 58017 states have internal predecessors, (134691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58018 states to 58018 states and 134691 transitions. [2022-01-17 22:24:57,052 INFO L78 Accepts]: Start accepts. Automaton has 58018 states and 134691 transitions. Word has length 792 [2022-01-17 22:24:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:24:57,052 INFO L470 AbstractCegarLoop]: Abstraction has 58018 states and 134691 transitions. [2022-01-17 22:24:57,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:24:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 58018 states and 134691 transitions. [2022-01-17 22:24:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-01-17 22:24:57,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:24:57,431 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:24:57,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-17 22:24:57,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:57,632 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:24:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:24:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 574269212, now seen corresponding path program 4 times [2022-01-17 22:24:57,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:24:57,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304646209] [2022-01-17 22:24:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:24:57,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:24:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:24:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3827 proven. 194 refuted. 0 times theorem prover too weak. 1869 trivial. 0 not checked. [2022-01-17 22:24:59,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:24:59,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304646209] [2022-01-17 22:24:59,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304646209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:24:59,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286857217] [2022-01-17 22:24:59,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-17 22:24:59,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:24:59,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:24:59,453 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:24:59,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-17 22:25:05,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-17 22:25:05,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:25:05,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-17 22:25:05,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:25:06,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-17 22:25:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:06,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-17 22:25:06,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:25:06,770 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-17 22:25:06,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-17 22:25:06,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:06,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-17 22:25:07,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-17 22:25:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:07,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 18 treesize of output 20 [2022-01-17 22:25:07,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:25:07,256 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-17 22:25:07,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-17 22:25:07,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:07,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-17 22:25:07,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-01-17 22:25:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2706 proven. 118 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2022-01-17 22:25:07,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:25:30,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:25:30,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-17 22:25:31,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:25:31,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-17 22:25:31,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:25:31,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-01-17 22:25:31,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) is different from false [2022-01-17 22:25:31,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) is different from false [2022-01-17 22:25:31,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))))))) is different from false [2022-01-17 22:25:31,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) is different from false [2022-01-17 22:25:31,681 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:25:31,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-01-17 22:25:31,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:25:31,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-01-17 22:25:31,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 809 treesize of output 789 [2022-01-17 22:25:31,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 789 [2022-01-17 22:25:31,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-17 22:25:31,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:25:31,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 220 [2022-01-17 22:25:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2563 proven. 89 refuted. 0 times theorem prover too weak. 3072 trivial. 166 not checked. [2022-01-17 22:25:32,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286857217] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:25:32,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:25:32,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 22] total 65 [2022-01-17 22:25:32,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912636628] [2022-01-17 22:25:32,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:25:32,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-17 22:25:32,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:25:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-17 22:25:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2605, Unknown=37, NotChecked=1150, Total=4160 [2022-01-17 22:25:32,503 INFO L87 Difference]: Start difference. First operand 58018 states and 134691 transitions. Second operand has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:25:33,618 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:25:34,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse3 .cse2))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2) 20))))))) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:25:34,554 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0)) is different from false [2022-01-17 22:25:34,979 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 1)) is different from false [2022-01-17 22:25:35,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse3 .cse2))) (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))))))))) is different from false [2022-01-17 22:25:35,914 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1)))))))) is different from false [2022-01-17 22:25:36,449 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:25:38,495 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:25:39,045 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1)) is different from false [2022-01-17 22:25:41,202 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1)) is different from false [2022-01-17 22:25:42,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= (+ (- 1) (select .cse0 .cse1)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse3)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* (select .cse0 84) 4) 8) (<= (* .cse4 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (not (= .cse4 20)) (<= |c_~#stored_elements~0.base| 6) (= (+ (- 1) (select (select |c_#memory_int| 7) .cse1)) 1))) is different from false [2022-01-17 22:25:42,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (+ (- 1) (select .cse0 (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2)))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 84) 4) 8) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-17 22:25:43,054 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 4) 8) (<= (* .cse2 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (not (= .cse2 20)))) is different from false [2022-01-17 22:25:43,381 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) (<= (* (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 4) 8)) is different from false [2022-01-17 22:25:44,333 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:25:44,876 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1)) is different from false [2022-01-17 22:25:45,504 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-17 22:25:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:25:46,839 INFO L93 Difference]: Finished difference Result 194303 states and 443137 transitions. [2022-01-17 22:25:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-17 22:25:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 792 [2022-01-17 22:25:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:25:47,184 INFO L225 Difference]: With dead ends: 194303 [2022-01-17 22:25:47,184 INFO L226 Difference]: Without dead ends: 194303 [2022-01-17 22:25:47,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1735 GetRequests, 1586 SyntacticMatches, 20 SemanticMatches, 129 ConstructedPredicates, 27 IntricatePredicates, 1 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=1521, Invalid=9245, Unknown=54, NotChecked=6210, Total=17030 [2022-01-17 22:25:47,185 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 6069 mSDsluCounter, 15789 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6069 SdHoareTripleChecker+Valid, 16278 SdHoareTripleChecker+Invalid, 12717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9243 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-17 22:25:47,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6069 Valid, 16278 Invalid, 12717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3309 Invalid, 0 Unknown, 9243 Unchecked, 1.2s Time] [2022-01-17 22:25:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194303 states. [2022-01-17 22:25:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194303 to 93381. [2022-01-17 22:25:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 93380 states have (on average 2.411169415292354) internal successors, (225155), 93380 states have internal predecessors, (225155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:25:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 225155 transitions. [2022-01-17 22:25:50,676 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 225155 transitions. Word has length 792 [2022-01-17 22:25:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:25:50,676 INFO L470 AbstractCegarLoop]: Abstraction has 93381 states and 225155 transitions. [2022-01-17 22:25:50,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 10.492307692307692) internal successors, (682), 65 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:25:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 225155 transitions. [2022-01-17 22:25:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2022-01-17 22:25:50,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:25:50,805 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:25:50,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-17 22:25:51,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:25:51,006 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-17 22:25:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:25:51,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1148069001, now seen corresponding path program 1 times [2022-01-17 22:25:51,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:25:51,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984660435] [2022-01-17 22:25:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:25:51,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:25:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:25:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3906 proven. 115 refuted. 0 times theorem prover too weak. 1869 trivial. 0 not checked. [2022-01-17 22:25:52,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:25:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984660435] [2022-01-17 22:25:52,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984660435] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:25:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871925923] [2022-01-17 22:25:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:25:52,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:25:52,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:25:52,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:25:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-17 22:25:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:25:53,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-17 22:25:53,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:25:54,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-17 22:25:54,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:54,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-17 22:25:55,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:25:55,008 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-17 22:25:55,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-17 22:25:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:55,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-17 22:25:55,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-17 22:25:55,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:55,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-17 22:25:55,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-17 22:25:55,390 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-17 22:25:55,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-17 22:25:55,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-17 22:25:55,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-17 22:25:55,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-01-17 22:25:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3292 proven. 302 refuted. 0 times theorem prover too weak. 2296 trivial. 0 not checked. [2022-01-17 22:25:55,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:26:10,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:26:10,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:26:11,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-01-17 22:26:11,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:26:11,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-01-17 22:26:11,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-01-17 22:26:11,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1)))))))) is different from false [2022-01-17 22:26:11,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse3))))))) is different from false [2022-01-17 22:26:11,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse1))))))) is different from false [2022-01-17 22:26:11,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2438))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse2 .cse1)))))))) is different from false [2022-01-17 22:26:11,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:26:11,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-01-17 22:26:11,608 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-17 22:26:11,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-01-17 22:26:11,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 273 [2022-01-17 22:26:11,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 831 treesize of output 811 [2022-01-17 22:26:11,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 Received shutdown request... [2022-01-17 22:37:36,253 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-17 22:37:36,257 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-17 22:37:36,305 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-17 22:37:36,306 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-17 22:37:36,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-17 22:37:36,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-17 22:37:36,507 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 82ms.. [2022-01-17 22:37:36,509 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-17 22:37:36,509 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-17 22:37:36,509 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-17 22:37:36,509 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-17 22:37:36,511 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2022-01-17 22:37:36,514 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 22:37:36,514 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 22:37:36,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 10:37:36 BasicIcfg [2022-01-17 22:37:36,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 22:37:36,517 INFO L158 Benchmark]: Toolchain (without parser) took 828774.52ms. Allocated memory was 348.1MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 288.1MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2022-01-17 22:37:36,517 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 348.1MB. Free memory is still 307.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 22:37:36,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.31ms. Allocated memory was 348.1MB in the beginning and 446.7MB in the end (delta: 98.6MB). Free memory was 288.0MB in the beginning and 396.6MB in the end (delta: -108.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. [2022-01-17 22:37:36,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.49ms. Allocated memory is still 446.7MB. Free memory was 396.6MB in the beginning and 393.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-17 22:37:36,518 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 446.7MB. Free memory was 393.7MB in the beginning and 391.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 22:37:36,518 INFO L158 Benchmark]: RCFGBuilder took 500.04ms. Allocated memory is still 446.7MB. Free memory was 391.6MB in the beginning and 371.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-17 22:37:36,518 INFO L158 Benchmark]: TraceAbstraction took 827552.76ms. Allocated memory was 446.7MB in the beginning and 7.0GB in the end (delta: 6.5GB). Free memory was 371.9MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2022-01-17 22:37:36,519 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.15ms. Allocated memory is still 348.1MB. Free memory is still 307.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 570.31ms. Allocated memory was 348.1MB in the beginning and 446.7MB in the end (delta: 98.6MB). Free memory was 288.0MB in the beginning and 396.6MB in the end (delta: -108.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 93.49ms. Allocated memory is still 446.7MB. Free memory was 396.6MB in the beginning and 393.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 446.7MB. Free memory was 393.7MB in the beginning and 391.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 500.04ms. Allocated memory is still 446.7MB. Free memory was 391.6MB in the beginning and 371.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 827552.76ms. Allocated memory was 446.7MB in the beginning and 7.0GB in the end (delta: 6.5GB). Free memory was 371.9MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 82ms.. - 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 82ms.. - 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 82ms.. - 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 82ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 827.3s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.0s, AutomataDifference: 42.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32961 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32961 mSDsluCounter, 46587 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19258 IncrementalHoareTripleChecker+Unchecked, 43618 mSDsCounter, 1631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9066 IncrementalHoareTripleChecker+Invalid, 29955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1631 mSolverCounterUnsat, 3463 mSDtfsCounter, 9066 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7840 GetRequests, 7070 SyntacticMatches, 58 SemanticMatches, 712 ConstructedPredicates, 51 IntricatePredicates, 1 DeprecatedPredicates, 31447 ImplicationChecksByTransitivity, 68.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93381occurred in iteration=13, InterpolantAutomatonStates: 515, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 183234 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 58.2s InterpolantComputationTime, 8588 NumberOfCodeBlocks, 7618 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12134 ConstructedInterpolants, 105 QuantifiedInterpolants, 48544 SizeOfPredicates, 109 NumberOfNonLiveVariables, 5657 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 44980/64449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown