/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 16:38:56,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 16:38:56,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 16:38:56,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 16:38:56,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 16:38:56,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 16:38:56,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 16:38:56,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 16:38:56,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 16:38:56,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 16:38:56,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 16:38:56,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 16:38:56,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 16:38:56,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 16:38:56,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 16:38:56,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 16:38:56,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 16:38:56,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 16:38:56,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 16:38:56,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 16:38:56,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 16:38:56,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 16:38:56,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 16:38:56,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 16:38:56,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 16:38:56,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 16:38:56,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 16:38:56,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 16:38:56,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 16:38:56,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 16:38:56,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 16:38:56,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 16:38:56,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 16:38:56,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 16:38:56,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 16:38:56,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 16:38:56,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 16:38:56,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 16:38:56,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 16:38:56,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 16:38:56,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 16:38:56,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 16:38:56,813 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 16:38:56,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 16:38:56,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 16:38:56,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 16:38:56,816 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 16:38:56,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 16:38:56,816 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 16:38:56,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 16:38:56,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 16:38:56,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 16:38:56,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 16:38:56,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 16:38:56,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 16:38:56,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 16:38:56,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 16:38:56,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 16:38:56,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 16:38:56,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 16:38:56,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 16:38:56,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 16:38:56,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 16:38:56,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 16:38:56,822 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 16:38:56,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 16:38:56,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 16:38:57,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 16:38:57,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 16:38:57,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 16:38:57,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 16:38:57,147 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 16:38:57,149 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2020-10-11 16:38:57,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a8b91a1/00b140e710094ff4b1798d5dace4e01e/FLAGe3b620ef3 [2020-10-11 16:38:57,773 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 16:38:57,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2020-10-11 16:38:57,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a8b91a1/00b140e710094ff4b1798d5dace4e01e/FLAGe3b620ef3 [2020-10-11 16:38:58,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a8b91a1/00b140e710094ff4b1798d5dace4e01e [2020-10-11 16:38:58,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 16:38:58,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 16:38:58,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 16:38:58,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 16:38:58,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 16:38:58,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:38:58" (1/1) ... [2020-10-11 16:38:58,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e354c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:58, skipping insertion in model container [2020-10-11 16:38:58,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:38:58" (1/1) ... [2020-10-11 16:38:58,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 16:38:58,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 16:38:58,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:38:58,808 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 16:38:58,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:38:59,096 INFO L208 MainTranslator]: Completed translation [2020-10-11 16:38:59,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59 WrapperNode [2020-10-11 16:38:59,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 16:38:59,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 16:38:59,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 16:38:59,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 16:38:59,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 16:38:59,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 16:38:59,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 16:38:59,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 16:38:59,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... [2020-10-11 16:38:59,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 16:38:59,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 16:38:59,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 16:38:59,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 16:38:59,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 16:38:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-11 16:38:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-11 16:38:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-11 16:38:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-11 16:38:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 16:38:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 16:38:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 16:38:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 16:38:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-11 16:38:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 16:38:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 16:38:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 16:38:59,329 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 16:38:59,984 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 16:38:59,984 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-11 16:38:59,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:38:59 BoogieIcfgContainer [2020-10-11 16:38:59,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 16:38:59,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 16:38:59,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 16:38:59,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 16:38:59,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:38:58" (1/3) ... [2020-10-11 16:38:59,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1290283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:38:59, skipping insertion in model container [2020-10-11 16:38:59,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:38:59" (2/3) ... [2020-10-11 16:38:59,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1290283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:38:59, skipping insertion in model container [2020-10-11 16:38:59,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:38:59" (3/3) ... [2020-10-11 16:38:59,996 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2020-10-11 16:39:00,007 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 16:39:00,017 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 16:39:00,018 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 16:39:00,058 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,058 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,058 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,059 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,059 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,059 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,060 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,060 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,060 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,061 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,061 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,061 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,061 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,062 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,062 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,062 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,062 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,062 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,063 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,063 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,063 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,063 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,064 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,064 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,064 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,064 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,064 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,065 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,065 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,065 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,065 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,065 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,066 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,066 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,066 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,066 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,066 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,067 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,067 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,067 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,067 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,068 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,068 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,068 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,068 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,068 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,069 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,069 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,069 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,069 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,070 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,070 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,070 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,070 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,071 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,071 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,071 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,071 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,072 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,072 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,073 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,073 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,073 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,073 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,074 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,074 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,074 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,074 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,074 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,075 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,075 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,075 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,075 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,076 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,076 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,076 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,076 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,076 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,077 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,077 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,077 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,077 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,078 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,078 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,078 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,078 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,080 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,080 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,080 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,080 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,081 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,081 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,081 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,081 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,082 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,082 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,082 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,082 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,083 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,083 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,083 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,083 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,084 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,084 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,084 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,084 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,085 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,085 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,085 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,085 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,085 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,086 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,086 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,086 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,086 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,087 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,087 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,087 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,087 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,087 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,088 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,088 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,088 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,088 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,088 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,089 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,089 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,089 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,089 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,089 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,090 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,090 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,090 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,090 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,091 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,092 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,092 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,092 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,092 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,092 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,093 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,094 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,094 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,094 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,094 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,094 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,095 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,095 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,095 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,095 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,095 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,096 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,096 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,096 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,096 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,096 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,097 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,097 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,097 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,097 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,097 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,098 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,099 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,099 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,099 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,099 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,099 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,100 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,100 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,100 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,100 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,101 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,101 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,101 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,101 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,101 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,102 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,102 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,102 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,102 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,102 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,103 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,103 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,103 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,103 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,103 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,104 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,104 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,104 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,104 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,105 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,105 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,105 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,105 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,105 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,106 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,106 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,109 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,122 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,123 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,123 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,123 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,124 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,124 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,125 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,126 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,127 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,128 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,129 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:00,165 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 16:39:00,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 16:39:00,183 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 16:39:00,183 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 16:39:00,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 16:39:00,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 16:39:00,184 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 16:39:00,184 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 16:39:00,184 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 16:39:00,198 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions, 430 flow [2020-10-11 16:39:00,279 INFO L129 PetriNetUnfolder]: 14/204 cut-off events. [2020-10-11 16:39:00,279 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 16:39:00,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2020-10-11 16:39:00,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 204 transitions, 430 flow [2020-10-11 16:39:00,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 192 transitions, 396 flow [2020-10-11 16:39:00,311 INFO L129 PetriNetUnfolder]: 2/51 cut-off events. [2020-10-11 16:39:00,311 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 16:39:00,313 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:00,314 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:00,314 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2020-10-11 16:39:00,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:00,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956862042] [2020-10-11 16:39:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:00,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956862042] [2020-10-11 16:39:00,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:00,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 16:39:00,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527161147] [2020-10-11 16:39:00,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-11 16:39:00,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-11 16:39:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 16:39:00,641 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 204 [2020-10-11 16:39:00,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 192 transitions, 396 flow. Second operand 2 states. [2020-10-11 16:39:00,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:00,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 204 [2020-10-11 16:39:00,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:00,703 INFO L129 PetriNetUnfolder]: 9/187 cut-off events. [2020-10-11 16:39:00,704 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 16:39:00,706 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 9/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2020-10-11 16:39:00,709 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 0 selfloop transitions, 0 changer transitions 0/185 dead transitions. [2020-10-11 16:39:00,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 185 transitions, 382 flow [2020-10-11 16:39:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-11 16:39:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-11 16:39:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 402 transitions. [2020-10-11 16:39:00,725 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9852941176470589 [2020-10-11 16:39:00,726 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 402 transitions. [2020-10-11 16:39:00,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 402 transitions. [2020-10-11 16:39:00,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:00,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 402 transitions. [2020-10-11 16:39:00,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-11 16:39:00,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-11 16:39:00,742 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-11 16:39:00,745 INFO L185 Difference]: Start difference. First operand has 185 places, 192 transitions, 396 flow. Second operand 2 states and 402 transitions. [2020-10-11 16:39:00,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 185 transitions, 382 flow [2020-10-11 16:39:00,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 16:39:00,756 INFO L241 Difference]: Finished difference. Result has 179 places, 185 transitions, 374 flow [2020-10-11 16:39:00,759 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=179, PETRI_TRANSITIONS=185} [2020-10-11 16:39:00,760 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -6 predicate places. [2020-10-11 16:39:00,760 INFO L481 AbstractCegarLoop]: Abstraction has has 179 places, 185 transitions, 374 flow [2020-10-11 16:39:00,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-11 16:39:00,760 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:00,761 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:00,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 16:39:00,761 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2020-10-11 16:39:00,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:00,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931842585] [2020-10-11 16:39:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:01,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931842585] [2020-10-11 16:39:01,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:01,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:39:01,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884181609] [2020-10-11 16:39:01,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:39:01,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:39:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:39:05,185 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2020-10-11 16:39:05,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 185 transitions, 374 flow. Second operand 12 states. [2020-10-11 16:39:05,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:05,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2020-10-11 16:39:05,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:05,691 INFO L129 PetriNetUnfolder]: 37/402 cut-off events. [2020-10-11 16:39:05,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 16:39:05,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 402 events. 37/402 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1424 event pairs, 15 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 476. Up to 54 conditions per place. [2020-10-11 16:39:05,696 INFO L132 encePairwiseOnDemand]: 189/204 looper letters, 15 selfloop transitions, 14 changer transitions 0/183 dead transitions. [2020-10-11 16:39:05,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 183 transitions, 428 flow [2020-10-11 16:39:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 16:39:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 16:39:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2227 transitions. [2020-10-11 16:39:05,704 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8397435897435898 [2020-10-11 16:39:05,705 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2227 transitions. [2020-10-11 16:39:05,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2227 transitions. [2020-10-11 16:39:05,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:05,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2227 transitions. [2020-10-11 16:39:05,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 16:39:05,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 16:39:05,718 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 16:39:05,718 INFO L185 Difference]: Start difference. First operand has 179 places, 185 transitions, 374 flow. Second operand 13 states and 2227 transitions. [2020-10-11 16:39:05,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 183 transitions, 428 flow [2020-10-11 16:39:05,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 183 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-11 16:39:05,724 INFO L241 Difference]: Finished difference. Result has 189 places, 183 transitions, 407 flow [2020-10-11 16:39:05,724 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=407, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2020-10-11 16:39:05,725 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 4 predicate places. [2020-10-11 16:39:05,725 INFO L481 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 407 flow [2020-10-11 16:39:05,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:39:05,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:05,726 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:05,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 16:39:05,726 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2020-10-11 16:39:05,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:05,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221056213] [2020-10-11 16:39:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:05,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221056213] [2020-10-11 16:39:05,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:05,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 16:39:05,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72580813] [2020-10-11 16:39:05,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:05,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 16:39:05,863 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 204 [2020-10-11 16:39:05,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 407 flow. Second operand 3 states. [2020-10-11 16:39:05,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:05,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 204 [2020-10-11 16:39:05,864 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:05,900 INFO L129 PetriNetUnfolder]: 11/258 cut-off events. [2020-10-11 16:39:05,900 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:05,901 INFO L80 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 258 events. 11/258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 622 event pairs, 0 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 289. Up to 8 conditions per place. [2020-10-11 16:39:05,902 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 2 selfloop transitions, 2 changer transitions 4/183 dead transitions. [2020-10-11 16:39:05,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 417 flow [2020-10-11 16:39:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2020-10-11 16:39:05,905 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2020-10-11 16:39:05,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 588 transitions. [2020-10-11 16:39:05,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions. [2020-10-11 16:39:05,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:05,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions. [2020-10-11 16:39:05,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:05,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:05,908 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:05,909 INFO L185 Difference]: Start difference. First operand has 189 places, 183 transitions, 407 flow. Second operand 3 states and 588 transitions. [2020-10-11 16:39:05,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 417 flow [2020-10-11 16:39:05,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 183 transitions, 396 flow, removed 0 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:05,914 INFO L241 Difference]: Finished difference. Result has 182 places, 179 transitions, 386 flow [2020-10-11 16:39:05,914 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=182, PETRI_TRANSITIONS=179} [2020-10-11 16:39:05,914 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -3 predicate places. [2020-10-11 16:39:05,914 INFO L481 AbstractCegarLoop]: Abstraction has has 182 places, 179 transitions, 386 flow [2020-10-11 16:39:05,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:05,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:05,915 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:05,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 16:39:05,915 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 621102753, now seen corresponding path program 1 times [2020-10-11 16:39:05,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:05,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865875320] [2020-10-11 16:39:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:05,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865875320] [2020-10-11 16:39:05,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:05,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 16:39:05,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607219018] [2020-10-11 16:39:05,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:05,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:05,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 16:39:06,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 204 [2020-10-11 16:39:06,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 179 transitions, 386 flow. Second operand 3 states. [2020-10-11 16:39:06,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:06,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 204 [2020-10-11 16:39:06,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:06,054 INFO L129 PetriNetUnfolder]: 12/283 cut-off events. [2020-10-11 16:39:06,054 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:06,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 283 events. 12/283 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 513 event pairs, 0 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 312. Up to 9 conditions per place. [2020-10-11 16:39:06,056 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 4 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2020-10-11 16:39:06,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 400 flow [2020-10-11 16:39:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2020-10-11 16:39:06,059 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9624183006535948 [2020-10-11 16:39:06,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 589 transitions. [2020-10-11 16:39:06,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions. [2020-10-11 16:39:06,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:06,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions. [2020-10-11 16:39:06,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:06,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:06,062 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:06,062 INFO L185 Difference]: Start difference. First operand has 182 places, 179 transitions, 386 flow. Second operand 3 states and 589 transitions. [2020-10-11 16:39:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 400 flow [2020-10-11 16:39:06,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 16:39:06,067 INFO L241 Difference]: Finished difference. Result has 181 places, 180 transitions, 394 flow [2020-10-11 16:39:06,068 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=181, PETRI_TRANSITIONS=180} [2020-10-11 16:39:06,068 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -4 predicate places. [2020-10-11 16:39:06,068 INFO L481 AbstractCegarLoop]: Abstraction has has 181 places, 180 transitions, 394 flow [2020-10-11 16:39:06,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:06,068 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:06,068 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:06,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 16:39:06,069 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 957471261, now seen corresponding path program 1 times [2020-10-11 16:39:06,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:06,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735466022] [2020-10-11 16:39:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:06,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735466022] [2020-10-11 16:39:06,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485633477] [2020-10-11 16:39:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:06,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-11 16:39:06,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:06,576 INFO L384 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 11 treesize of output 7 [2020-10-11 16:39:06,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:06,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:06,591 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:06,591 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-11 16:39:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-11 16:39:06,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-11 16:39:06,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-10-11 16:39:06,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345098407] [2020-10-11 16:39:06,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:06,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:06,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 16:39:06,738 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 204 [2020-10-11 16:39:06,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 394 flow. Second operand 3 states. [2020-10-11 16:39:06,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:06,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 204 [2020-10-11 16:39:06,739 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:06,811 INFO L129 PetriNetUnfolder]: 16/371 cut-off events. [2020-10-11 16:39:06,811 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 16:39:06,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 371 events. 16/371 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 970 event pairs, 1 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 416. Up to 12 conditions per place. [2020-10-11 16:39:06,813 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 2 selfloop transitions, 3 changer transitions 5/180 dead transitions. [2020-10-11 16:39:06,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 180 transitions, 406 flow [2020-10-11 16:39:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2020-10-11 16:39:06,816 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9591503267973857 [2020-10-11 16:39:06,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2020-10-11 16:39:06,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2020-10-11 16:39:06,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:06,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2020-10-11 16:39:06,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:06,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:06,820 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:06,820 INFO L185 Difference]: Start difference. First operand has 181 places, 180 transitions, 394 flow. Second operand 3 states and 587 transitions. [2020-10-11 16:39:06,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 180 transitions, 406 flow [2020-10-11 16:39:06,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 16:39:06,825 INFO L241 Difference]: Finished difference. Result has 182 places, 175 transitions, 387 flow [2020-10-11 16:39:06,826 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=182, PETRI_TRANSITIONS=175} [2020-10-11 16:39:06,826 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -3 predicate places. [2020-10-11 16:39:06,827 INFO L481 AbstractCegarLoop]: Abstraction has has 182 places, 175 transitions, 387 flow [2020-10-11 16:39:06,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:06,827 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:06,827 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 16:39:07,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:07,041 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash 134512671, now seen corresponding path program 1 times [2020-10-11 16:39:07,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:07,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443863886] [2020-10-11 16:39:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:07,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443863886] [2020-10-11 16:39:07,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408242079] [2020-10-11 16:39:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:07,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-11 16:39:07,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:07,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:07,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 16:39:07,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64117739] [2020-10-11 16:39:07,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 16:39:07,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:07,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 16:39:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 16:39:07,441 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:07,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 175 transitions, 387 flow. Second operand 7 states. [2020-10-11 16:39:07,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:07,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:07,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:07,524 INFO L129 PetriNetUnfolder]: 15/351 cut-off events. [2020-10-11 16:39:07,525 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:07,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 351 events. 15/351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 613 event pairs, 0 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 406. Up to 13 conditions per place. [2020-10-11 16:39:07,527 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2020-10-11 16:39:07,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 421 flow [2020-10-11 16:39:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:39:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:39:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2020-10-11 16:39:07,532 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951797385620915 [2020-10-11 16:39:07,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2020-10-11 16:39:07,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2020-10-11 16:39:07,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:07,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2020-10-11 16:39:07,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:39:07,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:39:07,538 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:39:07,538 INFO L185 Difference]: Start difference. First operand has 182 places, 175 transitions, 387 flow. Second operand 6 states and 1165 transitions. [2020-10-11 16:39:07,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 179 transitions, 421 flow [2020-10-11 16:39:07,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 179 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 16:39:07,543 INFO L241 Difference]: Finished difference. Result has 185 places, 178 transitions, 416 flow [2020-10-11 16:39:07,543 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=185, PETRI_TRANSITIONS=178} [2020-10-11 16:39:07,543 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 0 predicate places. [2020-10-11 16:39:07,544 INFO L481 AbstractCegarLoop]: Abstraction has has 185 places, 178 transitions, 416 flow [2020-10-11 16:39:07,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 16:39:07,544 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:07,544 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:39:07,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:07,759 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 878736081, now seen corresponding path program 2 times [2020-10-11 16:39:07,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:07,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129187941] [2020-10-11 16:39:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:07,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129187941] [2020-10-11 16:39:07,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118463244] [2020-10-11 16:39:07,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:08,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:39:08,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 16:39:08,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:08,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:08,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 16:39:08,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093708785] [2020-10-11 16:39:08,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 16:39:08,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 16:39:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-11 16:39:08,295 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:08,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 178 transitions, 416 flow. Second operand 9 states. [2020-10-11 16:39:08,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:08,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:08,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:08,443 INFO L129 PetriNetUnfolder]: 18/424 cut-off events. [2020-10-11 16:39:08,444 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-11 16:39:08,445 INFO L80 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 424 events. 18/424 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 733 event pairs, 0 based on Foata normal form. 2/414 useless extension candidates. Maximal degree in co-relation 518. Up to 16 conditions per place. [2020-10-11 16:39:08,446 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 8 changer transitions 0/182 dead transitions. [2020-10-11 16:39:08,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 182 transitions, 464 flow [2020-10-11 16:39:08,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 16:39:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 16:39:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2020-10-11 16:39:08,452 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2020-10-11 16:39:08,452 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2020-10-11 16:39:08,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2020-10-11 16:39:08,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:08,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2020-10-11 16:39:08,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 16:39:08,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 16:39:08,463 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 16:39:08,464 INFO L185 Difference]: Start difference. First operand has 185 places, 178 transitions, 416 flow. Second operand 9 states and 1744 transitions. [2020-10-11 16:39:08,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 182 transitions, 464 flow [2020-10-11 16:39:08,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 182 transitions, 458 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-11 16:39:08,471 INFO L241 Difference]: Finished difference. Result has 194 places, 181 transitions, 454 flow [2020-10-11 16:39:08,472 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=194, PETRI_TRANSITIONS=181} [2020-10-11 16:39:08,472 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 9 predicate places. [2020-10-11 16:39:08,472 INFO L481 AbstractCegarLoop]: Abstraction has has 194 places, 181 transitions, 454 flow [2020-10-11 16:39:08,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 16:39:08,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:08,473 INFO L255 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:39:08,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:08,686 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 249530583, now seen corresponding path program 3 times [2020-10-11 16:39:08,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:08,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270739063] [2020-10-11 16:39:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:08,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270739063] [2020-10-11 16:39:08,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736033964] [2020-10-11 16:39:08,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:09,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-11 16:39:09,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:09,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-11 16:39:09,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:09,276 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-10-11 16:39:09,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,281 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:39:09,317 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-11 16:39:09,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:39:09,326 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,329 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:39:09,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-10-11 16:39:09,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:39:09,465 INFO L384 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 [2020-10-11 16:39:09,466 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,480 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:39:09,614 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:09,630 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,631 INFO L384 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 57 [2020-10-11 16:39:09,632 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,660 INFO L625 ElimStorePlain]: treesize reduction 30, result has 50.0 percent of original size [2020-10-11 16:39:09,662 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2020-10-11 16:39:09,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:09,672 INFO L384 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 [2020-10-11 16:39:09,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,683 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:39:09,689 INFO L384 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 [2020-10-11 16:39:09,689 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:09,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:09,692 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:39:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-11 16:39:09,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:09,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2020-10-11 16:39:09,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765802851] [2020-10-11 16:39:09,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 16:39:09,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 16:39:09,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-10-11 16:39:20,756 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 204 [2020-10-11 16:39:20,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 181 transitions, 454 flow. Second operand 19 states. [2020-10-11 16:39:20,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:20,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 204 [2020-10-11 16:39:20,760 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:22,306 INFO L129 PetriNetUnfolder]: 28/820 cut-off events. [2020-10-11 16:39:22,307 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2020-10-11 16:39:22,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 820 events. 28/820 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2621 event pairs, 0 based on Foata normal form. 12/826 useless extension candidates. Maximal degree in co-relation 1328. Up to 39 conditions per place. [2020-10-11 16:39:22,314 INFO L132 encePairwiseOnDemand]: 186/204 looper letters, 94 selfloop transitions, 67 changer transitions 0/302 dead transitions. [2020-10-11 16:39:22,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 302 transitions, 1131 flow [2020-10-11 16:39:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-10-11 16:39:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-11 16:39:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7426 transitions. [2020-10-11 16:39:22,336 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8273172905525846 [2020-10-11 16:39:22,336 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7426 transitions. [2020-10-11 16:39:22,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7426 transitions. [2020-10-11 16:39:22,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:22,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7426 transitions. [2020-10-11 16:39:22,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 45 states. [2020-10-11 16:39:22,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 45 states. [2020-10-11 16:39:22,371 INFO L81 ComplementDD]: Finished complementDD. Result 45 states. [2020-10-11 16:39:22,372 INFO L185 Difference]: Start difference. First operand has 194 places, 181 transitions, 454 flow. Second operand 44 states and 7426 transitions. [2020-10-11 16:39:22,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 302 transitions, 1131 flow [2020-10-11 16:39:22,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 302 transitions, 1097 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-11 16:39:22,387 INFO L241 Difference]: Finished difference. Result has 249 places, 236 transitions, 877 flow [2020-10-11 16:39:22,388 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=877, PETRI_PLACES=249, PETRI_TRANSITIONS=236} [2020-10-11 16:39:22,388 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 64 predicate places. [2020-10-11 16:39:22,388 INFO L481 AbstractCegarLoop]: Abstraction has has 249 places, 236 transitions, 877 flow [2020-10-11 16:39:22,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 16:39:22,388 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:22,389 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:39:22,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:22,603 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1913665735, now seen corresponding path program 1 times [2020-10-11 16:39:22,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:22,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520229583] [2020-10-11 16:39:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:22,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520229583] [2020-10-11 16:39:22,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367709443] [2020-10-11 16:39:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:23,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 16:39:23,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:23,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:23,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-10-11 16:39:23,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685931334] [2020-10-11 16:39:23,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 16:39:23,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 16:39:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-11 16:39:23,620 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:23,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 236 transitions, 877 flow. Second operand 13 states. [2020-10-11 16:39:23,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:23,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:23,623 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:24,137 INFO L129 PetriNetUnfolder]: 32/956 cut-off events. [2020-10-11 16:39:24,137 INFO L130 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2020-10-11 16:39:24,144 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 956 events. 32/956 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3051 event pairs, 0 based on Foata normal form. 4/954 useless extension candidates. Maximal degree in co-relation 1841. Up to 58 conditions per place. [2020-10-11 16:39:24,148 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 24 changer transitions 0/240 dead transitions. [2020-10-11 16:39:24,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 240 transitions, 981 flow [2020-10-11 16:39:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 16:39:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 16:39:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2902 transitions. [2020-10-11 16:39:24,161 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9483660130718954 [2020-10-11 16:39:24,161 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2902 transitions. [2020-10-11 16:39:24,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2902 transitions. [2020-10-11 16:39:24,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:24,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2902 transitions. [2020-10-11 16:39:24,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 16:39:24,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 16:39:24,183 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 16:39:24,183 INFO L185 Difference]: Start difference. First operand has 249 places, 236 transitions, 877 flow. Second operand 15 states and 2902 transitions. [2020-10-11 16:39:24,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 240 transitions, 981 flow [2020-10-11 16:39:24,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 240 transitions, 921 flow, removed 14 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:24,197 INFO L241 Difference]: Finished difference. Result has 256 places, 239 transitions, 913 flow [2020-10-11 16:39:24,198 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=913, PETRI_PLACES=256, PETRI_TRANSITIONS=239} [2020-10-11 16:39:24,198 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 71 predicate places. [2020-10-11 16:39:24,199 INFO L481 AbstractCegarLoop]: Abstraction has has 256 places, 239 transitions, 913 flow [2020-10-11 16:39:24,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 16:39:24,199 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:24,200 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:39:24,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:24,406 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1070994261, now seen corresponding path program 2 times [2020-10-11 16:39:24,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:24,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090960134] [2020-10-11 16:39:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:24,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090960134] [2020-10-11 16:39:24,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707795136] [2020-10-11 16:39:24,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:24,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:39:24,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:24,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-11 16:39:24,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:24,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:24,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2020-10-11 16:39:24,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395167858] [2020-10-11 16:39:24,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:39:24,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:39:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:39:25,301 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:25,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 239 transitions, 913 flow. Second operand 15 states. [2020-10-11 16:39:25,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:25,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:25,304 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:25,705 INFO L129 PetriNetUnfolder]: 36/1092 cut-off events. [2020-10-11 16:39:25,705 INFO L130 PetriNetUnfolder]: For 1292/1292 co-relation queries the response was YES. [2020-10-11 16:39:25,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 1092 events. 36/1092 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3498 event pairs, 2 based on Foata normal form. 4/1090 useless extension candidates. Maximal degree in co-relation 2173. Up to 68 conditions per place. [2020-10-11 16:39:25,713 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 27 changer transitions 0/243 dead transitions. [2020-10-11 16:39:25,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 243 transitions, 1031 flow [2020-10-11 16:39:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:39:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:39:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3481 transitions. [2020-10-11 16:39:25,720 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479847494553377 [2020-10-11 16:39:25,720 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3481 transitions. [2020-10-11 16:39:25,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3481 transitions. [2020-10-11 16:39:25,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:25,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3481 transitions. [2020-10-11 16:39:25,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:39:25,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:39:25,733 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:39:25,733 INFO L185 Difference]: Start difference. First operand has 256 places, 239 transitions, 913 flow. Second operand 18 states and 3481 transitions. [2020-10-11 16:39:25,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 243 transitions, 1031 flow [2020-10-11 16:39:25,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 243 transitions, 972 flow, removed 11 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:25,744 INFO L241 Difference]: Finished difference. Result has 266 places, 242 transitions, 960 flow [2020-10-11 16:39:25,745 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=960, PETRI_PLACES=266, PETRI_TRANSITIONS=242} [2020-10-11 16:39:25,745 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 81 predicate places. [2020-10-11 16:39:25,745 INFO L481 AbstractCegarLoop]: Abstraction has has 266 places, 242 transitions, 960 flow [2020-10-11 16:39:25,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:39:25,746 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:25,746 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2020-10-11 16:39:25,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:25,961 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -995612082, now seen corresponding path program 3 times [2020-10-11 16:39:25,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:25,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137266135] [2020-10-11 16:39:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:26,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137266135] [2020-10-11 16:39:26,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837793051] [2020-10-11 16:39:26,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:26,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-11 16:39:26,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:26,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 68 conjunts are in the unsatisfiable core [2020-10-11 16:39:26,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:26,987 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-10-11 16:39:26,987 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:26,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:26,990 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:26,990 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:39:27,010 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-11 16:39:27,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:39:27,020 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,025 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,025 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:39:27,082 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-10-11 16:39:27,082 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,086 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:39:27,118 INFO L384 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 [2020-10-11 16:39:27,119 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,126 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,126 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:39:27,222 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:27,239 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:39:27,243 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,278 INFO L625 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2020-10-11 16:39:27,280 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:39:27,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:27,291 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-10-11 16:39:27,292 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,307 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,307 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:39:27,390 INFO L384 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 34 treesize of output 18 [2020-10-11 16:39:27,391 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,405 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-11 16:39:27,431 INFO L384 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 [2020-10-11 16:39:27,431 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,439 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:39:27,532 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:27,545 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,545 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:39:27,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:39:27,547 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,577 INFO L625 ElimStorePlain]: treesize reduction 35, result has 53.3 percent of original size [2020-10-11 16:39:27,578 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,578 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:39:27,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:27,588 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-10-11 16:39:27,589 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,603 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,604 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:39:27,676 INFO L384 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 34 treesize of output 18 [2020-10-11 16:39:27,676 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,685 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-11 16:39:27,719 INFO L384 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 [2020-10-11 16:39:27,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:39:27,839 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:27,857 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,858 INFO L384 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 49 [2020-10-11 16:39:27,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:39:27,864 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:39:27,887 INFO L625 ElimStorePlain]: treesize reduction 93, result has 26.2 percent of original size [2020-10-11 16:39:27,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2020-10-11 16:39:27,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:27,895 INFO L384 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 [2020-10-11 16:39:27,896 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,908 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:39:27,914 INFO L384 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 [2020-10-11 16:39:27,914 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:27,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:27,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:39:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 248 proven. 150 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-10-11 16:39:28,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:28,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2020-10-11 16:39:28,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239528120] [2020-10-11 16:39:28,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-10-11 16:39:28,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-10-11 16:39:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2020-10-11 16:40:11,353 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2020-10-11 16:40:11,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 242 transitions, 960 flow. Second operand 37 states. [2020-10-11 16:40:11,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:11,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2020-10-11 16:40:11,357 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:22,172 INFO L129 PetriNetUnfolder]: 408/2515 cut-off events. [2020-10-11 16:40:22,173 INFO L130 PetriNetUnfolder]: For 4234/4234 co-relation queries the response was YES. [2020-10-11 16:40:22,184 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6343 conditions, 2515 events. 408/2515 cut-off events. For 4234/4234 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11718 event pairs, 1 based on Foata normal form. 30/2534 useless extension candidates. Maximal degree in co-relation 6306. Up to 438 conditions per place. [2020-10-11 16:40:22,196 INFO L132 encePairwiseOnDemand]: 180/204 looper letters, 390 selfloop transitions, 313 changer transitions 0/837 dead transitions. [2020-10-11 16:40:22,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 837 transitions, 5689 flow [2020-10-11 16:40:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2020-10-11 16:40:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-11 16:40:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 29973 transitions. [2020-10-11 16:40:22,228 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7985134271099744 [2020-10-11 16:40:22,228 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 29973 transitions. [2020-10-11 16:40:22,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 29973 transitions. [2020-10-11 16:40:22,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:22,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 29973 transitions. [2020-10-11 16:40:22,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 185 states. [2020-10-11 16:40:22,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 185 states. [2020-10-11 16:40:22,305 INFO L81 ComplementDD]: Finished complementDD. Result 185 states. [2020-10-11 16:40:22,305 INFO L185 Difference]: Start difference. First operand has 266 places, 242 transitions, 960 flow. Second operand 184 states and 29973 transitions. [2020-10-11 16:40:22,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 837 transitions, 5689 flow [2020-10-11 16:40:22,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 837 transitions, 5475 flow, removed 60 selfloop flow, removed 14 redundant places. [2020-10-11 16:40:22,341 INFO L241 Difference]: Finished difference. Result has 511 places, 508 transitions, 3988 flow [2020-10-11 16:40:22,342 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=184, PETRI_FLOW=3988, PETRI_PLACES=511, PETRI_TRANSITIONS=508} [2020-10-11 16:40:22,342 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 326 predicate places. [2020-10-11 16:40:22,342 INFO L481 AbstractCegarLoop]: Abstraction has has 511 places, 508 transitions, 3988 flow [2020-10-11 16:40:22,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-10-11 16:40:22,343 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:22,343 INFO L255 CegarLoopForPetriNet]: 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, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:40:22,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:22,557 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1613063750, now seen corresponding path program 4 times [2020-10-11 16:40:22,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:22,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321090497] [2020-10-11 16:40:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:23,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321090497] [2020-10-11 16:40:23,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15633108] [2020-10-11 16:40:23,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:24,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 16:40:24,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:40:24,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-11 16:40:24,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:40:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:24,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:40:24,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2020-10-11 16:40:24,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781632987] [2020-10-11 16:40:24,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 16:40:24,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:40:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 16:40:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-10-11 16:40:24,839 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:40:24,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 508 transitions, 3988 flow. Second operand 19 states. [2020-10-11 16:40:24,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:24,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:40:24,842 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:26,498 INFO L129 PetriNetUnfolder]: 140/2520 cut-off events. [2020-10-11 16:40:26,498 INFO L130 PetriNetUnfolder]: For 39291/39291 co-relation queries the response was YES. [2020-10-11 16:40:26,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10240 conditions, 2520 events. 140/2520 cut-off events. For 39291/39291 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12626 event pairs, 0 based on Foata normal form. 8/2517 useless extension candidates. Maximal degree in co-relation 10127. Up to 185 conditions per place. [2020-10-11 16:40:26,540 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 74 changer transitions 0/512 dead transitions. [2020-10-11 16:40:26,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 512 transitions, 4240 flow [2020-10-11 16:40:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-11 16:40:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-11 16:40:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4639 transitions. [2020-10-11 16:40:26,547 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9475081699346405 [2020-10-11 16:40:26,547 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4639 transitions. [2020-10-11 16:40:26,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4639 transitions. [2020-10-11 16:40:26,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:26,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4639 transitions. [2020-10-11 16:40:26,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 25 states. [2020-10-11 16:40:26,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 25 states. [2020-10-11 16:40:26,557 INFO L81 ComplementDD]: Finished complementDD. Result 25 states. [2020-10-11 16:40:26,557 INFO L185 Difference]: Start difference. First operand has 511 places, 508 transitions, 3988 flow. Second operand 24 states and 4639 transitions. [2020-10-11 16:40:26,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 512 transitions, 4240 flow [2020-10-11 16:40:26,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 512 transitions, 2966 flow, removed 451 selfloop flow, removed 53 redundant places. [2020-10-11 16:40:26,711 INFO L241 Difference]: Finished difference. Result has 484 places, 511 transitions, 2950 flow [2020-10-11 16:40:26,712 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2714, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2950, PETRI_PLACES=484, PETRI_TRANSITIONS=511} [2020-10-11 16:40:26,712 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 299 predicate places. [2020-10-11 16:40:26,713 INFO L481 AbstractCegarLoop]: Abstraction has has 484 places, 511 transitions, 2950 flow [2020-10-11 16:40:26,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 16:40:26,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:26,713 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:40:26,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-11 16:40:26,927 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash 142088475, now seen corresponding path program 5 times [2020-10-11 16:40:26,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:26,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753835979] [2020-10-11 16:40:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:27,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753835979] [2020-10-11 16:40:27,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429274452] [2020-10-11 16:40:27,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:35,403 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-10-11 16:40:35,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:40:35,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-11 16:40:35,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:40:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:35,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:40:35,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2020-10-11 16:40:35,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501612979] [2020-10-11 16:40:35,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-11 16:40:35,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:40:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-11 16:40:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2020-10-11 16:40:36,277 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:40:36,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 511 transitions, 2950 flow. Second operand 21 states. [2020-10-11 16:40:36,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:36,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:40:36,279 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:37,306 INFO L129 PetriNetUnfolder]: 160/2841 cut-off events. [2020-10-11 16:40:37,307 INFO L130 PetriNetUnfolder]: For 43491/43491 co-relation queries the response was YES. [2020-10-11 16:40:37,332 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10688 conditions, 2841 events. 160/2841 cut-off events. For 43491/43491 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 14374 event pairs, 0 based on Foata normal form. 8/2838 useless extension candidates. Maximal degree in co-relation 10574. Up to 185 conditions per place. [2020-10-11 16:40:37,346 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 77 changer transitions 0/515 dead transitions. [2020-10-11 16:40:37,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 515 transitions, 3216 flow [2020-10-11 16:40:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-11 16:40:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-11 16:40:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5218 transitions. [2020-10-11 16:40:37,351 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9473493100944081 [2020-10-11 16:40:37,351 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5218 transitions. [2020-10-11 16:40:37,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5218 transitions. [2020-10-11 16:40:37,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:37,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5218 transitions. [2020-10-11 16:40:37,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 28 states. [2020-10-11 16:40:37,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 28 states. [2020-10-11 16:40:37,362 INFO L81 ComplementDD]: Finished complementDD. Result 28 states. [2020-10-11 16:40:37,362 INFO L185 Difference]: Start difference. First operand has 484 places, 511 transitions, 2950 flow. Second operand 27 states and 5218 transitions. [2020-10-11 16:40:37,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 515 transitions, 3216 flow [2020-10-11 16:40:38,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 515 transitions, 3039 flow, removed 23 selfloop flow, removed 19 redundant places. [2020-10-11 16:40:38,185 INFO L241 Difference]: Finished difference. Result has 494 places, 514 transitions, 3015 flow [2020-10-11 16:40:38,185 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2773, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3015, PETRI_PLACES=494, PETRI_TRANSITIONS=514} [2020-10-11 16:40:38,186 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 309 predicate places. [2020-10-11 16:40:38,186 INFO L481 AbstractCegarLoop]: Abstraction has has 494 places, 514 transitions, 3015 flow [2020-10-11 16:40:38,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-11 16:40:38,186 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:38,186 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 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] [2020-10-11 16:40:38,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:38,396 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1370216403, now seen corresponding path program 6 times [2020-10-11 16:40:38,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:38,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362649532] [2020-10-11 16:40:38,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:38,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362649532] [2020-10-11 16:40:38,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066994469] [2020-10-11 16:40:38,853 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:12,025 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-10-11 16:41:12,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:12,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-11 16:41:12,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:12,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:12,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2020-10-11 16:41:12,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941750586] [2020-10-11 16:41:12,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-11 16:41:12,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-11 16:41:12,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2020-10-11 16:41:13,185 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:13,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 514 transitions, 3015 flow. Second operand 23 states. [2020-10-11 16:41:13,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:13,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:13,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:14,371 INFO L129 PetriNetUnfolder]: 180/3162 cut-off events. [2020-10-11 16:41:14,371 INFO L130 PetriNetUnfolder]: For 49870/49870 co-relation queries the response was YES. [2020-10-11 16:41:14,407 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12078 conditions, 3162 events. 180/3162 cut-off events. For 49870/49870 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 16084 event pairs, 0 based on Foata normal form. 8/3159 useless extension candidates. Maximal degree in co-relation 11961. Up to 210 conditions per place. [2020-10-11 16:41:14,422 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 80 changer transitions 0/518 dead transitions. [2020-10-11 16:41:14,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 518 transitions, 3295 flow [2020-10-11 16:41:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-11 16:41:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-11 16:41:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5797 transitions. [2020-10-11 16:41:14,429 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9472222222222222 [2020-10-11 16:41:14,429 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5797 transitions. [2020-10-11 16:41:14,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5797 transitions. [2020-10-11 16:41:14,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:14,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5797 transitions. [2020-10-11 16:41:14,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 31 states. [2020-10-11 16:41:14,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 31 states. [2020-10-11 16:41:14,439 INFO L81 ComplementDD]: Finished complementDD. Result 31 states. [2020-10-11 16:41:14,439 INFO L185 Difference]: Start difference. First operand has 494 places, 514 transitions, 3015 flow. Second operand 30 states and 5797 transitions. [2020-10-11 16:41:14,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 518 transitions, 3295 flow [2020-10-11 16:41:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 518 transitions, 3087 flow, removed 30 selfloop flow, removed 23 redundant places. [2020-10-11 16:41:14,562 INFO L241 Difference]: Finished difference. Result has 503 places, 517 transitions, 3061 flow [2020-10-11 16:41:14,563 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3061, PETRI_PLACES=503, PETRI_TRANSITIONS=517} [2020-10-11 16:41:14,563 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 318 predicate places. [2020-10-11 16:41:14,563 INFO L481 AbstractCegarLoop]: Abstraction has has 503 places, 517 transitions, 3061 flow [2020-10-11 16:41:14,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-11 16:41:14,563 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:14,564 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 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] [2020-10-11 16:41:14,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:14,765 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1498316842, now seen corresponding path program 7 times [2020-10-11 16:41:14,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:14,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409679234] [2020-10-11 16:41:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:15,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409679234] [2020-10-11 16:41:15,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086708092] [2020-10-11 16:41:15,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:15,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-11 16:41:15,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:15,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:15,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2020-10-11 16:41:15,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068945786] [2020-10-11 16:41:15,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-11 16:41:15,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-11 16:41:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2020-10-11 16:41:16,759 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:16,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 517 transitions, 3061 flow. Second operand 25 states. [2020-10-11 16:41:16,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:16,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:16,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:18,181 INFO L129 PetriNetUnfolder]: 200/3483 cut-off events. [2020-10-11 16:41:18,182 INFO L130 PetriNetUnfolder]: For 56225/56225 co-relation queries the response was YES. [2020-10-11 16:41:18,207 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13428 conditions, 3483 events. 200/3483 cut-off events. For 56225/56225 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 17816 event pairs, 0 based on Foata normal form. 8/3480 useless extension candidates. Maximal degree in co-relation 13308. Up to 235 conditions per place. [2020-10-11 16:41:18,219 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 83 changer transitions 0/521 dead transitions. [2020-10-11 16:41:18,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 521 transitions, 3355 flow [2020-10-11 16:41:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-11 16:41:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-11 16:41:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6376 transitions. [2020-10-11 16:41:18,238 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9471182412358883 [2020-10-11 16:41:18,238 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6376 transitions. [2020-10-11 16:41:18,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6376 transitions. [2020-10-11 16:41:18,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:18,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6376 transitions. [2020-10-11 16:41:18,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 34 states. [2020-10-11 16:41:18,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 34 states. [2020-10-11 16:41:18,261 INFO L81 ComplementDD]: Finished complementDD. Result 34 states. [2020-10-11 16:41:18,261 INFO L185 Difference]: Start difference. First operand has 503 places, 517 transitions, 3061 flow. Second operand 33 states and 6376 transitions. [2020-10-11 16:41:18,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 521 transitions, 3355 flow [2020-10-11 16:41:18,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 521 transitions, 3135 flow, removed 33 selfloop flow, removed 26 redundant places. [2020-10-11 16:41:18,413 INFO L241 Difference]: Finished difference. Result has 512 places, 520 transitions, 3107 flow [2020-10-11 16:41:18,415 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3107, PETRI_PLACES=512, PETRI_TRANSITIONS=520} [2020-10-11 16:41:18,415 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 327 predicate places. [2020-10-11 16:41:18,415 INFO L481 AbstractCegarLoop]: Abstraction has has 512 places, 520 transitions, 3107 flow [2020-10-11 16:41:18,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-11 16:41:18,416 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:18,416 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 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] [2020-10-11 16:41:18,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-11 16:41:18,632 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash -806337567, now seen corresponding path program 8 times [2020-10-11 16:41:18,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:18,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005438579] [2020-10-11 16:41:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:19,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005438579] [2020-10-11 16:41:19,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173571994] [2020-10-11 16:41:19,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:19,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:41:19,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:19,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-11 16:41:19,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:19,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:19,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2020-10-11 16:41:19,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783289837] [2020-10-11 16:41:19,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-11 16:41:19,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-11 16:41:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-10-11 16:41:21,051 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:21,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 520 transitions, 3107 flow. Second operand 27 states. [2020-10-11 16:41:21,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:21,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:21,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:22,710 INFO L129 PetriNetUnfolder]: 220/3804 cut-off events. [2020-10-11 16:41:22,710 INFO L130 PetriNetUnfolder]: For 62676/62676 co-relation queries the response was YES. [2020-10-11 16:41:22,736 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14778 conditions, 3804 events. 220/3804 cut-off events. For 62676/62676 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 19536 event pairs, 0 based on Foata normal form. 8/3801 useless extension candidates. Maximal degree in co-relation 14655. Up to 260 conditions per place. [2020-10-11 16:41:22,752 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 86 changer transitions 0/524 dead transitions. [2020-10-11 16:41:22,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 524 transitions, 3415 flow [2020-10-11 16:41:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-11 16:41:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-11 16:41:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6955 transitions. [2020-10-11 16:41:22,759 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9470315904139434 [2020-10-11 16:41:22,759 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6955 transitions. [2020-10-11 16:41:22,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6955 transitions. [2020-10-11 16:41:22,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:22,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6955 transitions. [2020-10-11 16:41:22,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 37 states. [2020-10-11 16:41:22,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 37 states. [2020-10-11 16:41:22,770 INFO L81 ComplementDD]: Finished complementDD. Result 37 states. [2020-10-11 16:41:22,770 INFO L185 Difference]: Start difference. First operand has 512 places, 520 transitions, 3107 flow. Second operand 36 states and 6955 transitions. [2020-10-11 16:41:22,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 524 transitions, 3415 flow [2020-10-11 16:41:22,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 524 transitions, 3183 flow, removed 36 selfloop flow, removed 29 redundant places. [2020-10-11 16:41:22,935 INFO L241 Difference]: Finished difference. Result has 521 places, 523 transitions, 3153 flow [2020-10-11 16:41:22,936 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3153, PETRI_PLACES=521, PETRI_TRANSITIONS=523} [2020-10-11 16:41:22,936 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 336 predicate places. [2020-10-11 16:41:22,937 INFO L481 AbstractCegarLoop]: Abstraction has has 521 places, 523 transitions, 3153 flow [2020-10-11 16:41:22,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-11 16:41:22,937 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:22,937 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 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] [2020-10-11 16:41:23,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-11 16:41:23,151 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1315157728, now seen corresponding path program 9 times [2020-10-11 16:41:23,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:23,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359064622] [2020-10-11 16:41:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:24,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359064622] [2020-10-11 16:41:24,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980663484] [2020-10-11 16:41:24,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:26,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-11 16:41:26,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:26,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 100 conjunts are in the unsatisfiable core [2020-10-11 16:41:26,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:26,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-10-11 16:41:26,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,680 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:41:26,710 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,711 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-11 16:41:26,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:41:26,719 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,721 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:41:26,882 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-10-11 16:41:26,882 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:41:26,939 INFO L384 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 [2020-10-11 16:41:26,940 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,947 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,947 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:27,124 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:27,140 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,141 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:41:27,141 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,174 INFO L625 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2020-10-11 16:41:27,175 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:41:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:27,183 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-10-11 16:41:27,184 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,197 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:27,317 INFO L384 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 34 treesize of output 18 [2020-10-11 16:41:27,317 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-11 16:41:27,370 INFO L384 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 [2020-10-11 16:41:27,371 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,379 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:27,542 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:27,556 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:41:27,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:41:27,559 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,601 INFO L625 ElimStorePlain]: treesize reduction 35, result has 53.3 percent of original size [2020-10-11 16:41:27,604 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,604 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:41:27,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:27,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-10-11 16:41:27,619 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,632 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,632 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:27,841 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-10-11 16:41:27,842 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,848 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2020-10-11 16:41:27,892 INFO L384 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 [2020-10-11 16:41:27,893 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:27,900 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:27,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:28,064 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:28,081 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,082 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2020-10-11 16:41:28,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:41:28,088 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:41:28,131 INFO L625 ElimStorePlain]: treesize reduction 93, result has 28.5 percent of original size [2020-10-11 16:41:28,132 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,132 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:20 [2020-10-11 16:41:28,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:28,143 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-10-11 16:41:28,144 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,156 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:28,392 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-10-11 16:41:28,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2020-10-11 16:41:28,450 INFO L384 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 [2020-10-11 16:41:28,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,458 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:41:28,636 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:28,652 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,652 INFO L384 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 49 [2020-10-11 16:41:28,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:41:28,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:41:28,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:41:28,661 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:41:28,696 INFO L625 ElimStorePlain]: treesize reduction 94, result has 26.0 percent of original size [2020-10-11 16:41:28,697 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2020-10-11 16:41:28,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:28,706 INFO L384 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 [2020-10-11 16:41:28,707 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,716 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:41:28,721 INFO L384 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 [2020-10-11 16:41:28,722 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:28,724 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:28,724 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:41:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 971 proven. 353 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2020-10-11 16:41:29,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:29,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 34] total 59 [2020-10-11 16:41:29,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976308428] [2020-10-11 16:41:29,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 59 states [2020-10-11 16:41:29,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2020-10-11 16:41:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2989, Unknown=0, NotChecked=0, Total=3422 [2020-10-11 16:43:58,970 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 204 [2020-10-11 16:43:58,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 523 transitions, 3153 flow. Second operand 59 states. [2020-10-11 16:43:58,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:43:58,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 204 [2020-10-11 16:43:58,974 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:44:11,438 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-10-11 16:44:43,731 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-10-11 16:44:55,663 INFO L129 PetriNetUnfolder]: 932/5718 cut-off events. [2020-10-11 16:44:55,664 INFO L130 PetriNetUnfolder]: For 304677/304677 co-relation queries the response was YES. [2020-10-11 16:44:55,700 INFO L80 FinitePrefix]: Finished finitePrefix Result has 39972 conditions, 5718 events. 932/5718 cut-off events. For 304677/304677 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 31044 event pairs, 1 based on Foata normal form. 29/5734 useless extension candidates. Maximal degree in co-relation 39846. Up to 999 conditions per place. [2020-10-11 16:44:55,733 INFO L132 encePairwiseOnDemand]: 179/204 looper letters, 845 selfloop transitions, 792 changer transitions 0/1769 dead transitions. [2020-10-11 16:44:55,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 1769 transitions, 33305 flow [2020-10-11 16:44:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 444 states. [2020-10-11 16:44:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-11 16:44:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 71338 transitions. [2020-10-11 16:44:55,789 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7876037802508391 [2020-10-11 16:44:55,789 INFO L72 ComplementDD]: Start complementDD. Operand 444 states and 71338 transitions. [2020-10-11 16:44:55,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 71338 transitions. [2020-10-11 16:44:55,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:44:55,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 444 states and 71338 transitions. [2020-10-11 16:44:55,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 445 states. [2020-10-11 16:44:55,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 445 states. [2020-10-11 16:44:55,894 INFO L81 ComplementDD]: Finished complementDD. Result 445 states. [2020-10-11 16:44:55,895 INFO L185 Difference]: Start difference. First operand has 521 places, 523 transitions, 3153 flow. Second operand 444 states and 71338 transitions. [2020-10-11 16:44:55,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 1769 transitions, 33305 flow [2020-10-11 16:44:56,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 1769 transitions, 31787 flow, removed 614 selfloop flow, removed 33 redundant places. [2020-10-11 16:44:56,273 INFO L241 Difference]: Finished difference. Result has 1027 places, 996 transitions, 11921 flow [2020-10-11 16:44:56,274 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2847, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=444, PETRI_FLOW=11921, PETRI_PLACES=1027, PETRI_TRANSITIONS=996} [2020-10-11 16:44:56,274 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 842 predicate places. [2020-10-11 16:44:56,275 INFO L481 AbstractCegarLoop]: Abstraction has has 1027 places, 996 transitions, 11921 flow [2020-10-11 16:44:56,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2020-10-11 16:44:56,275 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:44:56,275 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 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] [2020-10-11 16:44:56,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-11 16:44:56,491 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:44:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:44:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 291296247, now seen corresponding path program 10 times [2020-10-11 16:44:56,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:44:56,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162224529] [2020-10-11 16:44:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:44:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:44:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:44:57,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162224529] [2020-10-11 16:44:57,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966304961] [2020-10-11 16:44:57,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:45:05,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 16:45:05,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:45:05,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-11 16:45:05,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:45:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:45:06,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:45:06,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2020-10-11 16:45:06,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163386582] [2020-10-11 16:45:06,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-11 16:45:06,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:45:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-11 16:45:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2020-10-11 16:45:08,537 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:45:08,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 996 transitions, 11921 flow. Second operand 31 states. [2020-10-11 16:45:08,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:45:08,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:45:08,541 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:45:14,080 INFO L129 PetriNetUnfolder]: 352/5443 cut-off events. [2020-10-11 16:45:14,080 INFO L130 PetriNetUnfolder]: For 499517/499517 co-relation queries the response was YES. [2020-10-11 16:45:14,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 36356 conditions, 5443 events. 352/5443 cut-off events. For 499517/499517 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 31531 event pairs, 0 based on Foata normal form. 10/5440 useless extension candidates. Maximal degree in co-relation 36135. Up to 427 conditions per place. [2020-10-11 16:45:14,175 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 177 changer transitions 0/1000 dead transitions. [2020-10-11 16:45:14,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1068 places, 1000 transitions, 12459 flow [2020-10-11 16:45:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-11 16:45:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-11 16:45:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 8113 transitions. [2020-10-11 16:45:14,183 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9468954248366013 [2020-10-11 16:45:14,184 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 8113 transitions. [2020-10-11 16:45:14,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 8113 transitions. [2020-10-11 16:45:14,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:45:14,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 8113 transitions. [2020-10-11 16:45:14,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 43 states. [2020-10-11 16:45:14,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 43 states. [2020-10-11 16:45:14,196 INFO L81 ComplementDD]: Finished complementDD. Result 43 states. [2020-10-11 16:45:14,196 INFO L185 Difference]: Start difference. First operand has 1027 places, 996 transitions, 11921 flow. Second operand 42 states and 8113 transitions. [2020-10-11 16:45:14,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1068 places, 1000 transitions, 12459 flow [2020-10-11 16:45:15,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 1000 transitions, 7136 flow, removed 2138 selfloop flow, removed 185 redundant places. [2020-10-11 16:45:15,855 INFO L241 Difference]: Finished difference. Result has 886 places, 999 transitions, 7102 flow [2020-10-11 16:45:15,856 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=6598, PETRI_DIFFERENCE_MINUEND_PLACES=842, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7102, PETRI_PLACES=886, PETRI_TRANSITIONS=999} [2020-10-11 16:45:15,857 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 701 predicate places. [2020-10-11 16:45:15,857 INFO L481 AbstractCegarLoop]: Abstraction has has 886 places, 999 transitions, 7102 flow [2020-10-11 16:45:15,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-11 16:45:15,857 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:45:15,857 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 11, 11, 11, 11, 11, 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] [2020-10-11 16:45:16,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:45:16,072 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:45:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:45:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -450679238, now seen corresponding path program 11 times [2020-10-11 16:45:16,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:45:16,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159839464] [2020-10-11 16:45:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:45:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:45:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 0 proven. 2807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:45:17,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159839464] [2020-10-11 16:45:17,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331390244] [2020-10-11 16:45:17,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:45:49,816 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2020-10-11 16:45:49,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:45:49,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 269 conjunts are in the unsatisfiable core [2020-10-11 16:45:49,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:45:50,531 INFO L384 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 32 treesize of output 16 [2020-10-11 16:45:50,533 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:50,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:50,538 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:45:50,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:12 [2020-10-11 16:45:50,662 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:50,662 INFO L384 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 26 treesize of output 63 [2020-10-11 16:45:50,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:50,665 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:50,744 INFO L625 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2020-10-11 16:45:50,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:50,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2020-10-11 16:45:50,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:50,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:51,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:51,495 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:51,500 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:51,543 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:51,543 INFO L384 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 32 treesize of output 50 [2020-10-11 16:45:51,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:45:51,547 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:45:51,588 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:51,588 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:45:51,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:45:51,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:45:51,592 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:45:51,769 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-10-11 16:45:51,771 INFO L625 ElimStorePlain]: treesize reduction 139, result has 35.0 percent of original size [2020-10-11 16:45:51,773 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:51,774 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:49 [2020-10-11 16:45:51,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:51,903 INFO L384 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 26 treesize of output 25 [2020-10-11 16:45:51,903 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:51,917 INFO L384 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 15 treesize of output 11 [2020-10-11 16:45:51,917 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:51,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:51,983 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:51,984 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2020-10-11 16:45:52,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:45:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:52,678 INFO L384 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 42 treesize of output 20 [2020-10-11 16:45:52,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:52,694 INFO L384 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 32 treesize of output 16 [2020-10-11 16:45:52,694 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:52,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:52,741 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:52,741 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:63 [2020-10-11 16:45:52,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:52,947 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:52,948 INFO L384 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 36 treesize of output 67 [2020-10-11 16:45:52,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:45:52,951 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:52,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:52,968 INFO L384 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 26 treesize of output 25 [2020-10-11 16:45:52,969 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:53,128 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-11 16:45:53,129 INFO L625 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2020-10-11 16:45:53,131 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:45:53,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:70 [2020-10-11 16:45:56,392 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:45:56,410 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:56,416 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:56,455 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:56,456 INFO L384 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 42 treesize of output 54 [2020-10-11 16:45:56,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:45:56,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:45:56,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:45:56,464 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:45:56,486 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:56,495 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:56,548 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:56,549 INFO L384 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 32 treesize of output 50 [2020-10-11 16:45:56,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:45:56,551 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:45:56,605 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:56,605 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:45:56,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:45:56,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:45:56,609 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-10-11 16:45:57,004 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2020-10-11 16:45:57,006 INFO L625 ElimStorePlain]: treesize reduction 238, result has 38.5 percent of original size [2020-10-11 16:45:57,015 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:45:57,016 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:151, output treesize:88 [2020-10-11 16:45:57,187 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:45:57,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:57,215 INFO L384 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 26 treesize of output 25 [2020-10-11 16:45:57,216 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:57,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:57,246 INFO L384 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 36 treesize of output 29 [2020-10-11 16:45:57,247 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:57,260 INFO L384 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 15 treesize of output 11 [2020-10-11 16:45:57,261 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:57,384 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-11 16:45:57,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:57,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:45:57,387 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:133, output treesize:88 [2020-10-11 16:45:57,966 INFO L384 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 23 treesize of output 13 [2020-10-11 16:45:57,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:57,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:57,971 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:45:57,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2020-10-11 16:45:58,112 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:58,113 INFO L384 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 25 treesize of output 62 [2020-10-11 16:45:58,114 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:58,177 INFO L625 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2020-10-11 16:45:58,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:58,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2020-10-11 16:45:58,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:58,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:59,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:59,235 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:59,241 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:45:59,284 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:59,285 INFO L384 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 57 [2020-10-11 16:45:59,285 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:59,336 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:59,336 INFO L384 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 25 treesize of output 54 [2020-10-11 16:45:59,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:59,338 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:59,550 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2020-10-11 16:45:59,552 INFO L625 ElimStorePlain]: treesize reduction 50, result has 64.8 percent of original size [2020-10-11 16:45:59,556 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:59,556 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2020-10-11 16:45:59,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:45:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:45:59,739 INFO L384 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 [2020-10-11 16:45:59,739 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:59,751 INFO L384 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 15 treesize of output 11 [2020-10-11 16:45:59,752 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:45:59,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:45:59,833 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:45:59,833 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:46:00,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:00,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:00,880 INFO L384 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 41 treesize of output 19 [2020-10-11 16:46:00,881 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:00,889 INFO L384 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 32 treesize of output 16 [2020-10-11 16:46:00,889 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:00,965 INFO L625 ElimStorePlain]: treesize reduction 13, result has 79.0 percent of original size [2020-10-11 16:46:00,966 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:00,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:49 [2020-10-11 16:46:01,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:01,242 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:01,243 INFO L384 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 25 treesize of output 62 [2020-10-11 16:46:01,243 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:01,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:01,263 INFO L384 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 26 treesize of output 25 [2020-10-11 16:46:01,264 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:01,415 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-10-11 16:46:01,417 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-10-11 16:46:01,418 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:46:01,419 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2020-10-11 16:46:01,647 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:46:01,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:02,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:02,760 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:02,765 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:02,804 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:02,805 INFO L384 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 49 [2020-10-11 16:46:02,805 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:02,848 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:02,849 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:46:02,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:46:02,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:02,851 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:46:03,027 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-11 16:46:03,029 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:46:03,032 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:03,032 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:46:03,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:03,228 INFO L384 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 15 treesize of output 11 [2020-10-11 16:46:03,228 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:03,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:03,252 INFO L384 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 [2020-10-11 16:46:03,252 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:03,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:03,331 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:03,331 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:46:04,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:04,490 INFO L384 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 32 treesize of output 16 [2020-10-11 16:46:04,491 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:04,499 INFO L384 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 41 treesize of output 19 [2020-10-11 16:46:04,499 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:04,576 INFO L625 ElimStorePlain]: treesize reduction 13, result has 79.0 percent of original size [2020-10-11 16:46:04,577 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:04,577 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:49 [2020-10-11 16:46:04,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:04,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:04,832 INFO L384 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 26 treesize of output 25 [2020-10-11 16:46:04,833 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:04,897 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:04,898 INFO L384 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 25 treesize of output 62 [2020-10-11 16:46:04,899 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:05,053 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-11 16:46:05,055 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-10-11 16:46:05,056 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:46:05,057 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2020-10-11 16:46:05,313 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:46:05,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:06,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:06,563 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:06,569 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:06,608 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:06,609 INFO L384 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 49 [2020-10-11 16:46:06,610 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:06,655 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:06,656 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:46:06,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:46:06,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:06,657 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:46:06,845 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-11 16:46:06,846 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:46:06,850 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:06,851 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:46:07,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:07,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:07,095 INFO L384 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 [2020-10-11 16:46:07,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:07,110 INFO L384 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 15 treesize of output 11 [2020-10-11 16:46:07,110 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:07,211 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-11 16:46:07,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:07,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:07,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:46:08,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:08,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:08,555 INFO L384 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 32 treesize of output 16 [2020-10-11 16:46:08,556 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:08,568 INFO L384 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 41 treesize of output 19 [2020-10-11 16:46:08,569 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:08,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:08,607 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:08,607 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:47 [2020-10-11 16:46:08,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:08,956 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:08,957 INFO L384 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 25 treesize of output 62 [2020-10-11 16:46:08,957 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:08,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:08,977 INFO L384 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 26 treesize of output 25 [2020-10-11 16:46:08,978 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:09,135 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-11 16:46:09,137 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-10-11 16:46:09,138 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:46:09,139 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2020-10-11 16:46:09,428 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:46:09,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:12,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:12,886 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:12,887 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:46:12,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:46:12,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:12,889 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:46:12,900 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:12,939 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:12,939 INFO L384 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 49 [2020-10-11 16:46:12,940 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:13,124 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-11 16:46:13,125 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:46:13,129 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:13,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:46:13,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:13,373 INFO L384 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 15 treesize of output 11 [2020-10-11 16:46:13,374 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:13,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:13,394 INFO L384 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 [2020-10-11 16:46:13,395 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:13,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:13,481 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:13,481 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:46:14,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:14,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:14,952 INFO L384 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 32 treesize of output 16 [2020-10-11 16:46:14,953 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:14,962 INFO L384 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 41 treesize of output 19 [2020-10-11 16:46:14,962 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:15,045 INFO L625 ElimStorePlain]: treesize reduction 13, result has 79.0 percent of original size [2020-10-11 16:46:15,045 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:15,046 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:49 [2020-10-11 16:46:15,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:15,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:15,391 INFO L384 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 26 treesize of output 25 [2020-10-11 16:46:15,391 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:15,464 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:15,465 INFO L384 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 25 treesize of output 62 [2020-10-11 16:46:15,465 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:15,630 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-10-11 16:46:15,631 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-10-11 16:46:15,633 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:46:15,633 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2020-10-11 16:46:15,969 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:46:16,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:17,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:17,541 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:17,547 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:17,590 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:17,591 INFO L384 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 49 [2020-10-11 16:46:17,591 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:17,643 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:17,643 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:46:17,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:46:17,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:17,645 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:46:17,851 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-11 16:46:17,853 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:46:17,858 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:17,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:46:18,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:18,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:18,148 INFO L384 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 [2020-10-11 16:46:18,149 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:18,163 INFO L384 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 15 treesize of output 11 [2020-10-11 16:46:18,163 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:18,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:18,252 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:46:18,253 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:46:19,302 INFO L384 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 23 treesize of output 13 [2020-10-11 16:46:19,303 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:19,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:19,330 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:19,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2020-10-11 16:46:19,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:19,627 INFO L384 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 [2020-10-11 16:46:19,627 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:19,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:19,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:19,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:46:21,358 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:21,394 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:21,394 INFO L384 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 57 [2020-10-11 16:46:21,395 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:21,510 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-11 16:46:21,511 INFO L625 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2020-10-11 16:46:21,513 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:21,514 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:46:21,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:21,528 INFO L384 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 [2020-10-11 16:46:21,529 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:21,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:21,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:21,576 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:46:23,074 INFO L384 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 [2020-10-11 16:46:23,074 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:23,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:23,110 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:23,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:46:23,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:23,443 INFO L384 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 [2020-10-11 16:46:23,443 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:23,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:23,478 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:23,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:46:25,364 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:25,404 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:25,405 INFO L384 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 49 [2020-10-11 16:46:25,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:46:25,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:25,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:46:25,409 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:46:25,528 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2020-10-11 16:46:25,529 INFO L625 ElimStorePlain]: treesize reduction 94, result has 37.7 percent of original size [2020-10-11 16:46:25,531 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:25,532 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2020-10-11 16:46:25,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:25,548 INFO L384 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 [2020-10-11 16:46:25,548 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:25,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:25,593 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:25,594 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:46:27,296 INFO L384 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 [2020-10-11 16:46:27,297 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:27,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:27,332 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:27,332 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:46:27,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:27,694 INFO L384 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 [2020-10-11 16:46:27,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:27,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:27,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:27,732 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:46:29,823 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:29,862 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:29,863 INFO L384 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 57 [2020-10-11 16:46:29,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:29,864 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:29,996 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-10-11 16:46:29,997 INFO L625 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2020-10-11 16:46:30,000 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:30,000 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:46:30,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:30,023 INFO L384 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 [2020-10-11 16:46:30,024 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:30,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:30,089 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:30,089 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:46:31,076 INFO L384 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 [2020-10-11 16:46:31,077 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:31,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:31,113 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:31,113 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:46:31,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:31,507 INFO L384 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 [2020-10-11 16:46:31,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:31,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:31,544 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:31,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:46:33,784 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:46:33,832 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:33,833 INFO L384 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 57 [2020-10-11 16:46:33,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:33,834 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:34,035 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-10-11 16:46:34,037 INFO L625 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2020-10-11 16:46:34,039 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:34,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:46:34,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:46:34,061 INFO L384 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 [2020-10-11 16:46:34,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:34,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:34,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:34,128 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:46:35,162 INFO L384 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 [2020-10-11 16:46:35,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:35,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:35,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:35,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:46:35,672 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:35,673 INFO L384 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 32 treesize of output 75 [2020-10-11 16:46:35,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:46:35,676 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:35,743 INFO L625 ElimStorePlain]: treesize reduction 44, result has 50.6 percent of original size [2020-10-11 16:46:35,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:35,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:9 [2020-10-11 16:46:37,064 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:37,064 INFO L384 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 34 treesize of output 57 [2020-10-11 16:46:37,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:46:37,066 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,130 INFO L625 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2020-10-11 16:46:37,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,134 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2020-10-11 16:46:37,168 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-11 16:46:37,169 INFO L384 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 25 treesize of output 24 [2020-10-11 16:46:37,169 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:37,185 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2020-10-11 16:46:37,195 INFO L384 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 [2020-10-11 16:46:37,196 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:46:37,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:46:37,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-11 16:46:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1824 proven. 978 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-11 16:46:39,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:46:39,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 122] total 151 [2020-10-11 16:46:39,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900001496] [2020-10-11 16:46:39,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 151 states [2020-10-11 16:46:39,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:46:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2020-10-11 16:46:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2094, Invalid=20554, Unknown=2, NotChecked=0, Total=22650 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown