/usr/bin/java -Xmx8000000000 -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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:36:45,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:36:45,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:36:45,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:36:45,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:36:45,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:36:45,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:36:45,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:36:45,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:36:45,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:36:45,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:36:45,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:36:45,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:36:45,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:36:45,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:36:45,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:36:45,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:36:45,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:36:45,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:36:45,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:36:45,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:36:45,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:36:45,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:36:45,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:36:45,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:36:45,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:36:45,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:36:45,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:36:45,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:36:45,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:36:45,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:36:45,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:36:45,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:36:45,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:36:45,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:36:45,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:36:45,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:36:45,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:36:45,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:36:45,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:36:45,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:36:45,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 08:36:45,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:36:45,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:36:45,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:36:45,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:36:45,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:36:45,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:36:45,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:36:45,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:36:45,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:36:45,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:36:45,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:36:45,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:36:45,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:36:45,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:36:45,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:36:45,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:36:45,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:36:45,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:36:45,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:36:45,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:36:45,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:36:45,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:36:45,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:36:45,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:36:45,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:36:46,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:36:46,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:36:46,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:36:46,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:36:46,150 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:36:46,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2019-12-27 08:36:46,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7006731fc/af38ba4b8d914b7cafd6b30d2973825b/FLAG86c14106c [2019-12-27 08:36:46,779 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:36:46,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2019-12-27 08:36:46,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7006731fc/af38ba4b8d914b7cafd6b30d2973825b/FLAG86c14106c [2019-12-27 08:36:47,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7006731fc/af38ba4b8d914b7cafd6b30d2973825b [2019-12-27 08:36:47,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:36:47,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:36:47,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:36:47,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:36:47,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:36:47,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:47,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74983f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47, skipping insertion in model container [2019-12-27 08:36:47,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:47,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:36:47,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:36:47,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:36:47,738 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:36:47,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:36:47,959 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:36:47,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47 WrapperNode [2019-12-27 08:36:47,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:36:47,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:36:47,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:36:47,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:36:47,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:36:48,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:36:48,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:36:48,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:36:48,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (1/1) ... [2019-12-27 08:36:48,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:36:48,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:36:48,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:36:48,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:36:48,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (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 [2019-12-27 08:36:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 08:36:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 08:36:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 08:36:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 08:36:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:36:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:36:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 08:36:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:36:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 08:36:48,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 08:36:48,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:36:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:36:48,194 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:36:48,852 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:36:48,856 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-27 08:36:48,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:36:48 BoogieIcfgContainer [2019-12-27 08:36:48,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:36:48,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:36:48,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:36:48,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:36:48,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:36:47" (1/3) ... [2019-12-27 08:36:48,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd84697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:36:48, skipping insertion in model container [2019-12-27 08:36:48,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:36:47" (2/3) ... [2019-12-27 08:36:48,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd84697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:36:48, skipping insertion in model container [2019-12-27 08:36:48,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:36:48" (3/3) ... [2019-12-27 08:36:48,867 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2019-12-27 08:36:48,877 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:36:48,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:36:48,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:36:48,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:36:48,927 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,927 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,927 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,927 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,930 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,930 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,931 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,931 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,931 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,931 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,932 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,932 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,932 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,932 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,933 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,934 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,934 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,934 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,934 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,934 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,935 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,936 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,937 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,938 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,938 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,939 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,939 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,939 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,940 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,940 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,940 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,940 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,940 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,941 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,942 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,942 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,942 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,942 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,942 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,943 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,944 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,944 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,944 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,944 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,944 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,945 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,945 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,945 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,946 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,946 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,946 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,946 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,946 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,948 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,948 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,949 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,949 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,949 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,949 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,950 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,957 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,957 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,957 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,958 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,959 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,960 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,960 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,961 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,962 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,962 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,963 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,963 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,963 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,963 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,963 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,964 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,964 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,968 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,968 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,968 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,976 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,976 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,977 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,983 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,983 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,985 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,986 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,990 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,992 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,993 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,994 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:48,995 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,001 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,002 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,008 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,008 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,008 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,009 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,009 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,009 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,009 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,009 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,010 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,011 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,011 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,011 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,012 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,018 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,026 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,027 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,027 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,027 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,028 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,029 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,029 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,029 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,029 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,029 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,030 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,031 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,031 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,031 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,032 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,033 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,033 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:36:49,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:36:49,076 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:36:49,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:36:49,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:36:49,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:36:49,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:36:49,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:36:49,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:36:49,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:36:49,097 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 196 places, 204 transitions [2019-12-27 08:36:49,606 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10787 states. [2019-12-27 08:36:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states. [2019-12-27 08:36:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 08:36:49,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:49,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:49,623 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2019-12-27 08:36:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:49,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781828095] [2019-12-27 08:36:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:50,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781828095] [2019-12-27 08:36:50,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:36:50,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:36:50,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122412899] [2019-12-27 08:36:50,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 08:36:50,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 08:36:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:36:50,086 INFO L87 Difference]: Start difference. First operand 10787 states. Second operand 2 states. [2019-12-27 08:36:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:50,228 INFO L93 Difference]: Finished difference Result 10784 states and 29353 transitions. [2019-12-27 08:36:50,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 08:36:50,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2019-12-27 08:36:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:50,319 INFO L225 Difference]: With dead ends: 10784 [2019-12-27 08:36:50,320 INFO L226 Difference]: Without dead ends: 9749 [2019-12-27 08:36:50,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:36:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-12-27 08:36:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9749. [2019-12-27 08:36:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-12-27 08:36:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 26526 transitions. [2019-12-27 08:36:50,816 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 26526 transitions. Word has length 44 [2019-12-27 08:36:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:50,816 INFO L462 AbstractCegarLoop]: Abstraction has 9749 states and 26526 transitions. [2019-12-27 08:36:50,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 08:36:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 26526 transitions. [2019-12-27 08:36:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 08:36:50,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:50,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:50,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2019-12-27 08:36:50,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:50,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657248718] [2019-12-27 08:36:50,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:51,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657248718] [2019-12-27 08:36:51,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:36:51,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:36:51,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591439104] [2019-12-27 08:36:51,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:36:51,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:36:51,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:36:51,254 INFO L87 Difference]: Start difference. First operand 9749 states and 26526 transitions. Second operand 12 states. [2019-12-27 08:36:51,651 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-27 08:36:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:52,038 INFO L93 Difference]: Finished difference Result 9780 states and 26590 transitions. [2019-12-27 08:36:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:36:52,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 08:36:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:52,106 INFO L225 Difference]: With dead ends: 9780 [2019-12-27 08:36:52,106 INFO L226 Difference]: Without dead ends: 9780 [2019-12-27 08:36:52,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-12-27 08:36:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-12-27 08:36:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9746. [2019-12-27 08:36:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-12-27 08:36:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 26522 transitions. [2019-12-27 08:36:52,521 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 26522 transitions. Word has length 97 [2019-12-27 08:36:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:52,522 INFO L462 AbstractCegarLoop]: Abstraction has 9746 states and 26522 transitions. [2019-12-27 08:36:52,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:36:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 26522 transitions. [2019-12-27 08:36:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 08:36:52,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:52,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:52,536 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2019-12-27 08:36:52,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:52,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881413538] [2019-12-27 08:36:52,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:53,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881413538] [2019-12-27 08:36:53,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:36:53,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:36:53,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35571848] [2019-12-27 08:36:53,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:36:53,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:36:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:36:53,313 INFO L87 Difference]: Start difference. First operand 9746 states and 26522 transitions. Second operand 18 states. [2019-12-27 08:36:53,995 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-12-27 08:36:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:55,756 INFO L93 Difference]: Finished difference Result 13022 states and 35325 transitions. [2019-12-27 08:36:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 08:36:55,757 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-27 08:36:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:55,789 INFO L225 Difference]: With dead ends: 13022 [2019-12-27 08:36:55,789 INFO L226 Difference]: Without dead ends: 13022 [2019-12-27 08:36:55,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:36:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2019-12-27 08:36:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 11672. [2019-12-27 08:36:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11672 states. [2019-12-27 08:36:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 31707 transitions. [2019-12-27 08:36:56,161 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 31707 transitions. Word has length 98 [2019-12-27 08:36:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:56,162 INFO L462 AbstractCegarLoop]: Abstraction has 11672 states and 31707 transitions. [2019-12-27 08:36:56,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:36:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 31707 transitions. [2019-12-27 08:36:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 08:36:56,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:56,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:56,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 921844576, now seen corresponding path program 1 times [2019-12-27 08:36:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:56,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331279865] [2019-12-27 08:36:56,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:56,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331279865] [2019-12-27 08:36:56,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:36:56,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:36:56,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14092194] [2019-12-27 08:36:56,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:36:56,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:36:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:36:56,257 INFO L87 Difference]: Start difference. First operand 11672 states and 31707 transitions. Second operand 4 states. [2019-12-27 08:36:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:56,403 INFO L93 Difference]: Finished difference Result 11918 states and 32061 transitions. [2019-12-27 08:36:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:36:56,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-27 08:36:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:56,445 INFO L225 Difference]: With dead ends: 11918 [2019-12-27 08:36:56,445 INFO L226 Difference]: Without dead ends: 11312 [2019-12-27 08:36:56,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:36:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-12-27 08:36:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 10268. [2019-12-27 08:36:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-12-27 08:36:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 27635 transitions. [2019-12-27 08:36:56,703 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 27635 transitions. Word has length 99 [2019-12-27 08:36:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:56,704 INFO L462 AbstractCegarLoop]: Abstraction has 10268 states and 27635 transitions. [2019-12-27 08:36:56,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:36:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 27635 transitions. [2019-12-27 08:36:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 08:36:56,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:56,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:56,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1815021150, now seen corresponding path program 1 times [2019-12-27 08:36:56,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:56,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576634776] [2019-12-27 08:36:56,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:56,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576634776] [2019-12-27 08:36:56,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:36:56,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:36:56,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697410934] [2019-12-27 08:36:56,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:36:56,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:36:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:36:56,789 INFO L87 Difference]: Start difference. First operand 10268 states and 27635 transitions. Second operand 3 states. [2019-12-27 08:36:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:56,809 INFO L93 Difference]: Finished difference Result 1808 states and 4120 transitions. [2019-12-27 08:36:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:36:56,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-27 08:36:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:56,812 INFO L225 Difference]: With dead ends: 1808 [2019-12-27 08:36:56,812 INFO L226 Difference]: Without dead ends: 1544 [2019-12-27 08:36:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:36:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-27 08:36:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1424. [2019-12-27 08:36:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-27 08:36:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3200 transitions. [2019-12-27 08:36:56,836 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3200 transitions. Word has length 116 [2019-12-27 08:36:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:56,837 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 3200 transitions. [2019-12-27 08:36:56,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:36:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3200 transitions. [2019-12-27 08:36:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 08:36:56,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:56,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:56,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -206631209, now seen corresponding path program 1 times [2019-12-27 08:36:56,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:56,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860971996] [2019-12-27 08:36:56,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:56,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860971996] [2019-12-27 08:36:56,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117186545] [2019-12-27 08:36:56,965 INFO L94 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 [2019-12-27 08:36:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:57,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 08:36:57,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:36:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:57,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:36:57,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 08:36:57,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065768691] [2019-12-27 08:36:57,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:36:57,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:36:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:36:57,195 INFO L87 Difference]: Start difference. First operand 1424 states and 3200 transitions. Second operand 7 states. [2019-12-27 08:36:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:57,277 INFO L93 Difference]: Finished difference Result 2240 states and 5060 transitions. [2019-12-27 08:36:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:36:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-12-27 08:36:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:57,295 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 08:36:57,296 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 08:36:57,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:36:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 08:36:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1844. [2019-12-27 08:36:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-27 08:36:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4157 transitions. [2019-12-27 08:36:57,379 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4157 transitions. Word has length 138 [2019-12-27 08:36:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:57,379 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 4157 transitions. [2019-12-27 08:36:57,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:36:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4157 transitions. [2019-12-27 08:36:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-27 08:36:57,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:57,386 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:36:57,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:36:57,592 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1577960977, now seen corresponding path program 2 times [2019-12-27 08:36:57,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:57,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119420774] [2019-12-27 08:36:57,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:57,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119420774] [2019-12-27 08:36:57,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409565281] [2019-12-27 08:36:57,783 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 08:36:57,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:36:57,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:36:57,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:36:57,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:36:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:57,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:36:57,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 08:36:57,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556648115] [2019-12-27 08:36:57,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:36:57,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:57,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:36:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:36:57,988 INFO L87 Difference]: Start difference. First operand 1844 states and 4157 transitions. Second operand 9 states. [2019-12-27 08:36:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:58,061 INFO L93 Difference]: Finished difference Result 2660 states and 6017 transitions. [2019-12-27 08:36:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:36:58,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-12-27 08:36:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:58,068 INFO L225 Difference]: With dead ends: 2660 [2019-12-27 08:36:58,068 INFO L226 Difference]: Without dead ends: 2660 [2019-12-27 08:36:58,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:36:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-12-27 08:36:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2264. [2019-12-27 08:36:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-27 08:36:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5114 transitions. [2019-12-27 08:36:58,111 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5114 transitions. Word has length 167 [2019-12-27 08:36:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:58,111 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 5114 transitions. [2019-12-27 08:36:58,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:36:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5114 transitions. [2019-12-27 08:36:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-27 08:36:58,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:58,118 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:36:58,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:36:58,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:36:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:36:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash -834842345, now seen corresponding path program 3 times [2019-12-27 08:36:58,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:36:58,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140254274] [2019-12-27 08:36:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:36:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:36:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:36:58,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140254274] [2019-12-27 08:36:58,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801606095] [2019-12-27 08:36:58,528 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 08:36:58,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 08:36:58,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:36:58,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-27 08:36:58,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:36:58,756 INFO L377 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 [2019-12-27 08:36:58,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:58,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,759 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 08:36:58,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:58,786 INFO L377 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 [2019-12-27 08:36:58,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:58,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 08:36:58,897 INFO L377 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 [2019-12-27 08:36:58,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:58,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 08:36:58,942 INFO L377 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 [2019-12-27 08:36:58,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:58,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:58,952 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 08:36:59,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:36:59,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:59,070 INFO L377 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 [2019-12-27 08:36:59,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:59,101 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 08:36:59,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:59,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 08:36:59,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:36:59,127 INFO L377 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 [2019-12-27 08:36:59,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:36:59,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:36:59,140 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:36:59,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 08:36:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-27 08:36:59,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 08:36:59,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-12-27 08:36:59,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435130687] [2019-12-27 08:36:59,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:36:59,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:36:59,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:36:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:36:59,242 INFO L87 Difference]: Start difference. First operand 2264 states and 5114 transitions. Second operand 13 states. [2019-12-27 08:36:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:36:59,859 INFO L93 Difference]: Finished difference Result 3701 states and 8378 transitions. [2019-12-27 08:36:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:36:59,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2019-12-27 08:36:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:36:59,869 INFO L225 Difference]: With dead ends: 3701 [2019-12-27 08:36:59,869 INFO L226 Difference]: Without dead ends: 3701 [2019-12-27 08:36:59,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:36:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-12-27 08:36:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3020. [2019-12-27 08:36:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-12-27 08:36:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 6827 transitions. [2019-12-27 08:36:59,934 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 6827 transitions. Word has length 196 [2019-12-27 08:36:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:36:59,935 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 6827 transitions. [2019-12-27 08:36:59,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:36:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 6827 transitions. [2019-12-27 08:36:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-27 08:36:59,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:36:59,945 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:37:00,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:37:00,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:37:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:37:00,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1197311036, now seen corresponding path program 1 times [2019-12-27 08:37:00,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:37:00,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108959756] [2019-12-27 08:37:00,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:37:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108959756] [2019-12-27 08:37:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684193924] [2019-12-27 08:37:00,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-12-27 08:37:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:00,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:37:00,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:37:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:00,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:37:00,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-27 08:37:00,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227545040] [2019-12-27 08:37:00,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:37:00,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:37:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:37:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:37:00,508 INFO L87 Difference]: Start difference. First operand 3020 states and 6827 transitions. Second operand 11 states. [2019-12-27 08:37:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:37:00,614 INFO L93 Difference]: Finished difference Result 4460 states and 10091 transitions. [2019-12-27 08:37:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:37:00,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2019-12-27 08:37:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:37:00,624 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 08:37:00,624 INFO L226 Difference]: Without dead ends: 4460 [2019-12-27 08:37:00,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:37:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-12-27 08:37:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3764. [2019-12-27 08:37:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-12-27 08:37:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8513 transitions. [2019-12-27 08:37:00,696 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8513 transitions. Word has length 200 [2019-12-27 08:37:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:37:00,697 INFO L462 AbstractCegarLoop]: Abstraction has 3764 states and 8513 transitions. [2019-12-27 08:37:00,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:37:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8513 transitions. [2019-12-27 08:37:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-27 08:37:00,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:37:00,708 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:37:00,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:37:00,912 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:37:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:37:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1476674553, now seen corresponding path program 2 times [2019-12-27 08:37:00,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:37:00,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293345195] [2019-12-27 08:37:00,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:37:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:01,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293345195] [2019-12-27 08:37:01,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565107245] [2019-12-27 08:37:01,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 08:37:01,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:37:01,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:37:01,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 08:37:01,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:37:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:01,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:37:01,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-27 08:37:01,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871420316] [2019-12-27 08:37:01,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:37:01,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:37:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:37:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:37:01,350 INFO L87 Difference]: Start difference. First operand 3764 states and 8513 transitions. Second operand 13 states. [2019-12-27 08:37:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:37:01,527 INFO L93 Difference]: Finished difference Result 5204 states and 11777 transitions. [2019-12-27 08:37:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:37:01,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2019-12-27 08:37:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:37:01,536 INFO L225 Difference]: With dead ends: 5204 [2019-12-27 08:37:01,536 INFO L226 Difference]: Without dead ends: 5204 [2019-12-27 08:37:01,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-27 08:37:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2019-12-27 08:37:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4508. [2019-12-27 08:37:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-27 08:37:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 10199 transitions. [2019-12-27 08:37:01,616 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 10199 transitions. Word has length 233 [2019-12-27 08:37:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:37:01,617 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 10199 transitions. [2019-12-27 08:37:01,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:37:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 10199 transitions. [2019-12-27 08:37:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-27 08:37:01,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:37:01,628 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:37:01,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:37:01,832 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:37:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:37:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -308517151, now seen corresponding path program 3 times [2019-12-27 08:37:01,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:37:01,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561421943] [2019-12-27 08:37:01,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:37:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:02,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561421943] [2019-12-27 08:37:02,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287667826] [2019-12-27 08:37:02,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 08:37:02,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 08:37:02,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:37:02,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-27 08:37:02,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:37:02,416 INFO L377 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 [2019-12-27 08:37:02,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 08:37:02,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,444 INFO L377 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 [2019-12-27 08:37:02,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 08:37:02,570 INFO L377 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 [2019-12-27 08:37:02,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 08:37:02,610 INFO L377 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 [2019-12-27 08:37:02,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 08:37:02,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:02,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,747 INFO L377 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 [2019-12-27 08:37:02,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,784 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 08:37:02,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,786 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 08:37:02,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:02,816 INFO L377 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 [2019-12-27 08:37:02,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 08:37:02,967 INFO L377 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 [2019-12-27 08:37:02,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:02,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:02,976 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 08:37:03,013 INFO L377 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 [2019-12-27 08:37:03,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:03,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-27 08:37:03,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:03,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:03,158 INFO L377 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 [2019-12-27 08:37:03,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,192 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-27 08:37:03,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-27 08:37:03,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:03,228 INFO L377 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 [2019-12-27 08:37:03,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:03,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-27 08:37:03,248 INFO L377 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 [2019-12-27 08:37:03,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:03,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:03,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-27 08:37:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 160 proven. 90 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-27 08:37:03,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:37:03,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2019-12-27 08:37:03,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480184179] [2019-12-27 08:37:03,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 08:37:03,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:37:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 08:37:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:37:03,464 INFO L87 Difference]: Start difference. First operand 4508 states and 10199 transitions. Second operand 32 states. [2019-12-27 08:37:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:37:10,697 INFO L93 Difference]: Finished difference Result 9594 states and 21721 transitions. [2019-12-27 08:37:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 08:37:10,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 262 [2019-12-27 08:37:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:37:10,706 INFO L225 Difference]: With dead ends: 9594 [2019-12-27 08:37:10,706 INFO L226 Difference]: Without dead ends: 9594 [2019-12-27 08:37:10,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 348 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7033 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3481, Invalid=16259, Unknown=0, NotChecked=0, Total=19740 [2019-12-27 08:37:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2019-12-27 08:37:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 7016. [2019-12-27 08:37:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-12-27 08:37:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 15866 transitions. [2019-12-27 08:37:10,830 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 15866 transitions. Word has length 262 [2019-12-27 08:37:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:37:10,831 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 15866 transitions. [2019-12-27 08:37:10,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 08:37:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 15866 transitions. [2019-12-27 08:37:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-27 08:37:10,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:37:10,854 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:37:11,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:37:11,061 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:37:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:37:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1631031548, now seen corresponding path program 4 times [2019-12-27 08:37:11,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:37:11,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858275672] [2019-12-27 08:37:11,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:37:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:11,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858275672] [2019-12-27 08:37:11,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063285795] [2019-12-27 08:37:11,364 INFO L92 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 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 [2019-12-27 08:37:12,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:37:12,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:37:12,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 08:37:12,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:37:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:12,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:37:12,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-27 08:37:12,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033860527] [2019-12-27 08:37:12,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 08:37:12,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:37:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 08:37:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:37:12,390 INFO L87 Difference]: Start difference. First operand 7016 states and 15866 transitions. Second operand 17 states. [2019-12-27 08:37:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:37:12,635 INFO L93 Difference]: Finished difference Result 9224 states and 20858 transitions. [2019-12-27 08:37:12,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 08:37:12,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 295 [2019-12-27 08:37:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:37:12,648 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 08:37:12,648 INFO L226 Difference]: Without dead ends: 9224 [2019-12-27 08:37:12,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:37:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2019-12-27 08:37:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 8156. [2019-12-27 08:37:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8156 states. [2019-12-27 08:37:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 18443 transitions. [2019-12-27 08:37:12,821 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 18443 transitions. Word has length 295 [2019-12-27 08:37:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:37:12,822 INFO L462 AbstractCegarLoop]: Abstraction has 8156 states and 18443 transitions. [2019-12-27 08:37:12,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 08:37:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 18443 transitions. [2019-12-27 08:37:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-12-27 08:37:12,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:37:12,849 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-27 08:37:13,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:37:13,056 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:37:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:37:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -697021545, now seen corresponding path program 5 times [2019-12-27 08:37:13,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:37:13,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646348550] [2019-12-27 08:37:13,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:37:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:37:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:13,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646348550] [2019-12-27 08:37:13,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403143640] [2019-12-27 08:37:13,390 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 08:37:13,712 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 08:37:13,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:37:13,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 125 conjunts are in the unsatisfiable core [2019-12-27 08:37:13,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:37:13,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 08:37:13,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:13,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:13,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:13,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 08:37:13,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:13,803 INFO L377 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 [2019-12-27 08:37:13,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:13,832 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-27 08:37:13,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:13,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-27 08:37:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:14,090 INFO L377 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 [2019-12-27 08:37:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:14,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:14,117 INFO L377 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 [2019-12-27 08:37:14,118 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,218 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 08:37:14,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:14,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 08:37:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:14,273 INFO L377 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 [2019-12-27 08:37:14,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,286 INFO L377 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 [2019-12-27 08:37:14,286 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:14,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:14,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 08:37:14,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,467 INFO L377 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 [2019-12-27 08:37:14,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,474 INFO L377 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 25 treesize of output 15 [2019-12-27 08:37:14,475 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:14,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:14,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:34 [2019-12-27 08:37:14,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:14,581 INFO L377 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 [2019-12-27 08:37:14,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:14,583 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,588 INFO L377 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 [2019-12-27 08:37:14,589 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:14,658 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-27 08:37:14,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:37:14,660 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-27 08:37:14,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:37:14,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,050 INFO L377 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 [2019-12-27 08:37:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:15,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,072 INFO L377 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 [2019-12-27 08:37:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,073 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,178 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-27 08:37:15,180 INFO L614 ElimStorePlain]: treesize reduction 54, result has 64.5 percent of original size [2019-12-27 08:37:15,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:15,181 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 08:37:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,229 INFO L377 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 [2019-12-27 08:37:15,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:15,237 INFO L377 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 [2019-12-27 08:37:15,238 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:15,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 08:37:15,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:15,413 INFO L377 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 21 treesize of output 11 [2019-12-27 08:37:15,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 08:37:15,417 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:15,427 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:34 [2019-12-27 08:37:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,470 INFO L377 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 [2019-12-27 08:37:15,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,500 INFO L377 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 [2019-12-27 08:37:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,501 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:15,567 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-27 08:37:15,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:37:15,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-27 08:37:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:37:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,919 INFO L377 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 [2019-12-27 08:37:15,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:37:15,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:15,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:15,946 INFO L377 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 [2019-12-27 08:37:15,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:15,948 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,026 INFO L614 ElimStorePlain]: treesize reduction 52, result has 63.9 percent of original size [2019-12-27 08:37:16,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:16,027 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:48 [2019-12-27 08:37:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:16,080 INFO L377 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 [2019-12-27 08:37:16,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:16,089 INFO L377 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 [2019-12-27 08:37:16,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:37:16,120 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 08:37:16,295 INFO L377 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 [2019-12-27 08:37:16,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 08:37:16,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:16,354 INFO L377 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 [2019-12-27 08:37:16,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:37:16,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:16,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,665 INFO L377 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 [2019-12-27 08:37:16,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,713 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-27 08:37:16,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:37:16,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:16,763 INFO L377 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 [2019-12-27 08:37:16,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:37:16,923 INFO L377 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 [2019-12-27 08:37:16,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:16,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:16,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 08:37:16,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:16,989 INFO L377 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 [2019-12-27 08:37:16,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:17,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:37:17,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:37:17,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:17,321 INFO L377 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 [2019-12-27 08:37:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:17,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,366 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-27 08:37:17,367 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,367 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:37:17,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:17,426 INFO L377 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 [2019-12-27 08:37:17,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:17,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:37:17,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 08:37:17,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:17,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-27 08:37:17,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:37:17,788 INFO L377 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 [2019-12-27 08:37:17,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:17,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:17,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:37:17,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 08:37:18,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:18,097 INFO L377 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 31 treesize of output 49 [2019-12-27 08:37:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:37:18,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:37:18,120 INFO L614 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2019-12-27 08:37:18,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:18,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:9 [2019-12-27 08:37:18,133 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-27 08:37:18,134 INFO L377 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 [2019-12-27 08:37:18,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:18,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:18,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:18,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-27 08:37:18,145 INFO L377 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 [2019-12-27 08:37:18,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:37:18,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:37:18,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:37:18,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-27 08:37:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 354 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:37:18,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:37:18,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 52] total 67 [2019-12-27 08:37:18,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307802901] [2019-12-27 08:37:18,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-27 08:37:18,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:37:18,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-27 08:37:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=3836, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 08:37:18,664 INFO L87 Difference]: Start difference. First operand 8156 states and 18443 transitions. Second operand 67 states. [2019-12-27 08:37:26,983 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 08:37:37,192 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-27 08:37:39,342 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 08:38:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:38:02,194 INFO L93 Difference]: Finished difference Result 29282 states and 66884 transitions. [2019-12-27 08:38:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2019-12-27 08:38:02,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2019-12-27 08:38:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:38:02,216 INFO L225 Difference]: With dead ends: 29282 [2019-12-27 08:38:02,217 INFO L226 Difference]: Without dead ends: 29282 [2019-12-27 08:38:02,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 581 SyntacticMatches, 17 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90147 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=22228, Invalid=175352, Unknown=0, NotChecked=0, Total=197580 [2019-12-27 08:38:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29282 states. [2019-12-27 08:38:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29282 to 19266. [2019-12-27 08:38:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19266 states. [2019-12-27 08:38:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 43952 transitions. [2019-12-27 08:38:02,618 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 43952 transitions. Word has length 328 [2019-12-27 08:38:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:38:02,618 INFO L462 AbstractCegarLoop]: Abstraction has 19266 states and 43952 transitions. [2019-12-27 08:38:02,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-27 08:38:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 43952 transitions. [2019-12-27 08:38:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-12-27 08:38:02,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:38:02,648 INFO L411 BasicCegarLoop]: 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, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-27 08:38:02,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:38:02,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:38:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:38:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -543563556, now seen corresponding path program 6 times [2019-12-27 08:38:02,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:38:02,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58878422] [2019-12-27 08:38:02,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:38:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:38:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:03,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58878422] [2019-12-27 08:38:03,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082713116] [2019-12-27 08:38:03,298 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 08:38:08,497 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 08:38:08,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:38:08,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-27 08:38:08,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:38:08,520 INFO L377 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 [2019-12-27 08:38:08,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 08:38:08,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-27 08:38:08,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,577 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-27 08:38:08,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,578 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-27 08:38:08,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-27 08:38:08,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-12-27 08:38:08,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 08:38:08,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,713 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-27 08:38:08,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:08,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-27 08:38:08,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-12-27 08:38:08,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:08,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-27 08:38:08,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:08,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:08,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:08,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-12-27 08:38:09,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:09,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:09,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:38:09,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 109 [2019-12-27 08:38:09,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,201 INFO L614 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2019-12-27 08:38:09,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:47 [2019-12-27 08:38:09,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:09,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:38:09,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-12-27 08:38:09,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2019-12-27 08:38:09,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2019-12-27 08:38:09,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,477 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2019-12-27 08:38:09,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-27 08:38:09,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,548 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,549 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:47, output treesize:24 [2019-12-27 08:38:09,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:38:09,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 67 [2019-12-27 08:38:09,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:38:09,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,821 INFO L614 ElimStorePlain]: treesize reduction 35, result has 57.3 percent of original size [2019-12-27 08:38:09,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2019-12-27 08:38:09,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:38:09,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-27 08:38:09,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:38:09,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:27 [2019-12-27 08:38:09,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-27 08:38:09,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:38:09,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:38:09,896 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2019-12-27 08:38:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 310 proven. 19 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-12-27 08:38:10,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:38:10,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2019-12-27 08:38:10,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941252378] [2019-12-27 08:38:10,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 08:38:10,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:38:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 08:38:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 08:38:10,220 INFO L87 Difference]: Start difference. First operand 19266 states and 43952 transitions. Second operand 40 states. [2019-12-27 08:38:11,521 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-27 08:38:11,692 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 08:38:12,166 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-12-27 08:38:12,580 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-12-27 08:38:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:38:15,281 INFO L93 Difference]: Finished difference Result 24976 states and 56996 transitions. [2019-12-27 08:38:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 08:38:15,281 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 361 [2019-12-27 08:38:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:38:15,304 INFO L225 Difference]: With dead ends: 24976 [2019-12-27 08:38:15,304 INFO L226 Difference]: Without dead ends: 24976 [2019-12-27 08:38:15,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1754, Invalid=6802, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 08:38:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24976 states. [2019-12-27 08:38:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24976 to 21612. [2019-12-27 08:38:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21612 states. [2019-12-27 08:38:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21612 states to 21612 states and 49348 transitions. [2019-12-27 08:38:15,612 INFO L78 Accepts]: Start accepts. Automaton has 21612 states and 49348 transitions. Word has length 361 [2019-12-27 08:38:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:38:15,612 INFO L462 AbstractCegarLoop]: Abstraction has 21612 states and 49348 transitions. [2019-12-27 08:38:15,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 08:38:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21612 states and 49348 transitions. [2019-12-27 08:38:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-12-27 08:38:15,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:38:15,632 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:38:15,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:38:15,833 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:38:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:38:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2042829257, now seen corresponding path program 7 times [2019-12-27 08:38:15,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:38:15,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848814430] [2019-12-27 08:38:15,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:38:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:38:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:16,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848814430] [2019-12-27 08:38:16,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988681496] [2019-12-27 08:38:16,415 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 08:38:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:38:16,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 08:38:16,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:38:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:16,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:38:16,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-12-27 08:38:16,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577561727] [2019-12-27 08:38:16,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 08:38:16,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:38:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 08:38:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:38:16,756 INFO L87 Difference]: Start difference. First operand 21612 states and 49348 transitions. Second operand 23 states. [2019-12-27 08:38:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:38:17,311 INFO L93 Difference]: Finished difference Result 28538 states and 65091 transitions. [2019-12-27 08:38:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:38:17,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 394 [2019-12-27 08:38:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:38:17,345 INFO L225 Difference]: With dead ends: 28538 [2019-12-27 08:38:17,345 INFO L226 Difference]: Without dead ends: 28538 [2019-12-27 08:38:17,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 08:38:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-27 08:38:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 25158. [2019-12-27 08:38:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25158 states. [2019-12-27 08:38:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25158 states to 25158 states and 57405 transitions. [2019-12-27 08:38:17,693 INFO L78 Accepts]: Start accepts. Automaton has 25158 states and 57405 transitions. Word has length 394 [2019-12-27 08:38:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:38:17,694 INFO L462 AbstractCegarLoop]: Abstraction has 25158 states and 57405 transitions. [2019-12-27 08:38:17,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 08:38:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 25158 states and 57405 transitions. [2019-12-27 08:38:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-12-27 08:38:17,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:38:17,724 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:38:17,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:38:17,928 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:38:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:38:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash -126761620, now seen corresponding path program 8 times [2019-12-27 08:38:17,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:38:17,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610602263] [2019-12-27 08:38:17,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:38:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:38:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:18,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610602263] [2019-12-27 08:38:18,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424172481] [2019-12-27 08:38:18,721 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 08:38:18,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:38:18,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:38:18,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 08:38:18,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:38:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:19,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:38:19,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-12-27 08:38:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353664339] [2019-12-27 08:38:19,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 08:38:19,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:38:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 08:38:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:38:19,074 INFO L87 Difference]: Start difference. First operand 25158 states and 57405 transitions. Second operand 25 states. [2019-12-27 08:38:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:38:19,554 INFO L93 Difference]: Finished difference Result 32130 states and 73255 transitions. [2019-12-27 08:38:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 08:38:19,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 427 [2019-12-27 08:38:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:38:19,585 INFO L225 Difference]: With dead ends: 32130 [2019-12-27 08:38:19,585 INFO L226 Difference]: Without dead ends: 32130 [2019-12-27 08:38:19,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 08:38:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32130 states. [2019-12-27 08:38:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32130 to 28750. [2019-12-27 08:38:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28750 states. [2019-12-27 08:38:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28750 states to 28750 states and 65569 transitions. [2019-12-27 08:38:20,198 INFO L78 Accepts]: Start accepts. Automaton has 28750 states and 65569 transitions. Word has length 427 [2019-12-27 08:38:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:38:20,200 INFO L462 AbstractCegarLoop]: Abstraction has 28750 states and 65569 transitions. [2019-12-27 08:38:20,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 08:38:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 28750 states and 65569 transitions. [2019-12-27 08:38:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-12-27 08:38:20,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:38:20,236 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:38:20,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:38:20,441 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:38:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:38:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash -265789225, now seen corresponding path program 9 times [2019-12-27 08:38:20,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:38:20,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287175051] [2019-12-27 08:38:20,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:38:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:38:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:38:20,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287175051] [2019-12-27 08:38:20,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111121882] [2019-12-27 08:38:20,917 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 08:39:10,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 08:39:10,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:39:10,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 117 conjunts are in the unsatisfiable core [2019-12-27 08:39:10,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:39:10,671 INFO L377 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 [2019-12-27 08:39:10,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 08:39:10,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,700 INFO L377 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 [2019-12-27 08:39:10,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 08:39:10,780 INFO L377 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 [2019-12-27 08:39:10,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,788 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,788 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 08:39:10,825 INFO L377 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 [2019-12-27 08:39:10,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 08:39:10,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:10,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:10,948 INFO L377 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 [2019-12-27 08:39:10,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,983 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 08:39:10,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:10,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 08:39:11,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:11,018 INFO L377 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 [2019-12-27 08:39:11,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 08:39:11,175 INFO L377 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 [2019-12-27 08:39:11,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 08:39:11,219 INFO L377 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 [2019-12-27 08:39:11,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 08:39:11,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:11,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,364 INFO L377 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 [2019-12-27 08:39:11,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,394 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-27 08:39:11,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-27 08:39:11,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:11,433 INFO L377 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 [2019-12-27 08:39:11,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 08:39:11,621 INFO L377 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 [2019-12-27 08:39:11,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,627 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 08:39:11,663 INFO L377 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 [2019-12-27 08:39:11,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 08:39:11,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:11,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,821 INFO L377 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 [2019-12-27 08:39:11,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,853 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-27 08:39:11,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-27 08:39:11,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:11,894 INFO L377 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 [2019-12-27 08:39:11,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:11,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:11,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 08:39:12,117 INFO L377 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 [2019-12-27 08:39:12,118 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:12,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 08:39:12,196 INFO L377 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 [2019-12-27 08:39:12,197 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:12,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-27 08:39:12,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:12,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:12,388 INFO L377 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 [2019-12-27 08:39:12,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,413 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-27 08:39:12,414 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-27 08:39:12,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:12,462 INFO L377 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 [2019-12-27 08:39:12,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:12,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-27 08:39:12,478 INFO L377 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 [2019-12-27 08:39:12,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:12,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:12,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-27 08:39:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1132 proven. 287 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-12-27 08:39:13,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:39:13,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2019-12-27 08:39:13,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097692999] [2019-12-27 08:39:13,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-27 08:39:13,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:39:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-27 08:39:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2773, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 08:39:13,088 INFO L87 Difference]: Start difference. First operand 28750 states and 65569 transitions. Second operand 56 states. [2019-12-27 08:39:33,184 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-27 08:39:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:39:39,289 INFO L93 Difference]: Finished difference Result 46514 states and 106373 transitions. [2019-12-27 08:39:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 374 states. [2019-12-27 08:39:39,290 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 460 [2019-12-27 08:39:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:39:39,327 INFO L225 Difference]: With dead ends: 46514 [2019-12-27 08:39:39,327 INFO L226 Difference]: Without dead ends: 46514 [2019-12-27 08:39:39,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1166 GetRequests, 734 SyntacticMatches, 7 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80010 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=16978, Invalid=164924, Unknown=0, NotChecked=0, Total=181902 [2019-12-27 08:39:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46514 states. [2019-12-27 08:39:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46514 to 20536. [2019-12-27 08:39:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20536 states. [2019-12-27 08:39:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20536 states to 20536 states and 46511 transitions. [2019-12-27 08:39:39,648 INFO L78 Accepts]: Start accepts. Automaton has 20536 states and 46511 transitions. Word has length 460 [2019-12-27 08:39:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:39:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 20536 states and 46511 transitions. [2019-12-27 08:39:39,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-27 08:39:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20536 states and 46511 transitions. [2019-12-27 08:39:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-12-27 08:39:39,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:39:39,668 INFO L411 BasicCegarLoop]: 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] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2019-12-27 08:39:39,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:39:39,877 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:39:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:39:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash -415367242, now seen corresponding path program 10 times [2019-12-27 08:39:39,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:39:39,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136800337] [2019-12-27 08:39:39,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:39:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:39:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:39:40,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136800337] [2019-12-27 08:39:40,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372771784] [2019-12-27 08:39:40,683 INFO L92 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 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 [2019-12-27 08:39:44,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:39:44,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:39:44,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 08:39:44,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:39:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:39:44,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:39:44,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-12-27 08:39:44,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796938741] [2019-12-27 08:39:44,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 08:39:44,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:39:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 08:39:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:39:44,823 INFO L87 Difference]: Start difference. First operand 20536 states and 46511 transitions. Second operand 29 states. [2019-12-27 08:39:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:39:45,424 INFO L93 Difference]: Finished difference Result 24280 states and 54959 transitions. [2019-12-27 08:39:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 08:39:45,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 493 [2019-12-27 08:39:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:39:45,445 INFO L225 Difference]: With dead ends: 24280 [2019-12-27 08:39:45,445 INFO L226 Difference]: Without dead ends: 24280 [2019-12-27 08:39:45,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 08:39:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24280 states. [2019-12-27 08:39:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24280 to 22468. [2019-12-27 08:39:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22468 states. [2019-12-27 08:39:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22468 states to 22468 states and 50870 transitions. [2019-12-27 08:39:45,684 INFO L78 Accepts]: Start accepts. Automaton has 22468 states and 50870 transitions. Word has length 493 [2019-12-27 08:39:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:39:45,684 INFO L462 AbstractCegarLoop]: Abstraction has 22468 states and 50870 transitions. [2019-12-27 08:39:45,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 08:39:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22468 states and 50870 transitions. [2019-12-27 08:39:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-27 08:39:45,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:39:45,703 INFO L411 BasicCegarLoop]: 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] [2019-12-27 08:39:45,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:39:45,904 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:39:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:39:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -394651699, now seen corresponding path program 11 times [2019-12-27 08:39:45,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:39:45,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251516506] [2019-12-27 08:39:45,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:39:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:39:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:39:46,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251516506] [2019-12-27 08:39:46,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932054281] [2019-12-27 08:39:46,627 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 08:39:51,516 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-12-27 08:39:51,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:39:51,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 217 conjunts are in the unsatisfiable core [2019-12-27 08:39:51,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:39:51,657 INFO L377 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 [2019-12-27 08:39:51,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:51,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:51,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:51,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-12-27 08:39:51,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:51,707 INFO L377 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 [2019-12-27 08:39:51,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:51,735 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-27 08:39:51,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:51,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-27 08:39:51,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:51,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:52,055 INFO L377 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 [2019-12-27 08:39:52,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:52,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:52,082 INFO L377 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 [2019-12-27 08:39:52,082 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,178 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 08:39:52,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:52,179 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 08:39:52,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,230 INFO L377 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 [2019-12-27 08:39:52,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:52,240 INFO L377 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 [2019-12-27 08:39:52,240 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:52,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:52,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 08:39:52,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:52,577 INFO L377 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 [2019-12-27 08:39:52,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,584 INFO L377 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 [2019-12-27 08:39:52,585 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,604 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:52,604 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:52,605 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:44 [2019-12-27 08:39:52,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:52,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:52,680 INFO L377 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 [2019-12-27 08:39:52,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:52,709 INFO L377 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 [2019-12-27 08:39:52,709 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:52,776 INFO L614 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-12-27 08:39:52,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:39:52,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:58 [2019-12-27 08:39:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:39:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:53,178 INFO L377 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 [2019-12-27 08:39:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:39:53,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:53,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:53,196 INFO L377 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 [2019-12-27 08:39:53,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,272 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-27 08:39:53,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:53,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-27 08:39:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:53,361 INFO L377 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 [2019-12-27 08:39:53,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,374 INFO L377 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 [2019-12-27 08:39:53,375 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,404 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:53,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:53,405 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 08:39:53,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:53,779 INFO L377 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 [2019-12-27 08:39:53,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,785 INFO L377 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 [2019-12-27 08:39:53,785 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,817 INFO L614 ElimStorePlain]: treesize reduction 11, result has 80.4 percent of original size [2019-12-27 08:39:53,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:53,818 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-27 08:39:53,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:53,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:53,896 INFO L377 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 [2019-12-27 08:39:53,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:53,927 INFO L377 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 [2019-12-27 08:39:53,927 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:53,993 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-27 08:39:53,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:39:53,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-27 08:39:54,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:39:54,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:54,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:54,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:54,510 INFO L377 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 [2019-12-27 08:39:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:54,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:39:54,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:54,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:54,537 INFO L377 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 [2019-12-27 08:39:54,537 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:54,613 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-27 08:39:54,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:54,614 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-27 08:39:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:54,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:54,691 INFO L377 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 [2019-12-27 08:39:54,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:54,698 INFO L377 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 [2019-12-27 08:39:54,698 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:54,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:54,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:54,731 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 08:39:55,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:55,167 INFO L377 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 [2019-12-27 08:39:55,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:55,171 INFO L377 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 [2019-12-27 08:39:55,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:55,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:55,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:55,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-27 08:39:55,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:55,297 INFO L377 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 [2019-12-27 08:39:55,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:55,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:55,306 INFO L377 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 [2019-12-27 08:39:55,307 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:55,371 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-27 08:39:55,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:39:55,372 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-27 08:39:55,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:39:55,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:55,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:55,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:55,920 INFO L377 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 [2019-12-27 08:39:55,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:55,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:55,940 INFO L377 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 [2019-12-27 08:39:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:55,943 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-27 08:39:56,036 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-27 08:39:56,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:56,037 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-27 08:39:56,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:56,125 INFO L377 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 [2019-12-27 08:39:56,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:56,134 INFO L377 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 [2019-12-27 08:39:56,134 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:56,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:56,168 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 08:39:56,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:56,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:56,668 INFO L377 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 [2019-12-27 08:39:56,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,674 INFO L377 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 [2019-12-27 08:39:56,675 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:56,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:56,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-27 08:39:56,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:56,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:56,791 INFO L377 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 [2019-12-27 08:39:56,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:56,821 INFO L377 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 [2019-12-27 08:39:56,822 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:56,887 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-27 08:39:56,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 08:39:56,888 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-27 08:39:56,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 08:39:57,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:57,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:57,566 INFO L377 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 [2019-12-27 08:39:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:57,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:39:57,571 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:57,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:57,587 INFO L377 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 [2019-12-27 08:39:57,588 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:57,655 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-27 08:39:57,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:57,656 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-27 08:39:57,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:39:57,777 INFO L377 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 [2019-12-27 08:39:57,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:57,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:57,788 INFO L377 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 [2019-12-27 08:39:57,788 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:57,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:57,819 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 08:39:57,819 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 08:39:58,296 INFO L377 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 [2019-12-27 08:39:58,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:58,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:58,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:58,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 08:39:58,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:58,426 INFO L377 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 [2019-12-27 08:39:58,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:58,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:58,439 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:58,439 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:39:58,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:39:58,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:58,974 INFO L377 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 [2019-12-27 08:39:58,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,019 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-27 08:39:59,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:39:59,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:59,126 INFO L377 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 [2019-12-27 08:39:59,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:59,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:39:59,411 INFO L377 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 [2019-12-27 08:39:59,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:59,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 08:39:59,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:39:59,516 INFO L377 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 [2019-12-27 08:39:59,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:39:59,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:39:59,529 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:40:00,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:40:00,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:00,123 INFO L377 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 [2019-12-27 08:40:00,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:40:00,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:00,174 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-27 08:40:00,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:00,175 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:40:00,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:00,434 INFO L377 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 [2019-12-27 08:40:00,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:00,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:00,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:00,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:40:01,295 INFO L377 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 [2019-12-27 08:40:01,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:01,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:01,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:01,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 08:40:01,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:01,473 INFO L377 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 [2019-12-27 08:40:01,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:01,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:01,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:01,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:40:02,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:40:02,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:02,105 INFO L377 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 [2019-12-27 08:40:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:40:02,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,152 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-27 08:40:02,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:40:02,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:02,282 INFO L377 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 [2019-12-27 08:40:02,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:02,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:40:02,932 INFO L377 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 [2019-12-27 08:40:02,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:02,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:02,946 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 08:40:03,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:03,051 INFO L377 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 [2019-12-27 08:40:03,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:03,064 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,064 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 08:40:03,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:40:03,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:03,713 INFO L377 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 [2019-12-27 08:40:03,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:40:03,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,759 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-27 08:40:03,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 08:40:03,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:03,893 INFO L377 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 [2019-12-27 08:40:03,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:03,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:03,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 08:40:04,527 INFO L377 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 [2019-12-27 08:40:04,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:04,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:04,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:04,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 08:40:04,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:40:04,652 INFO L377 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 [2019-12-27 08:40:04,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:04,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:04,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:40:04,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 08:40:05,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:05,072 INFO L377 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 [2019-12-27 08:40:05,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:40:05,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,096 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-27 08:40:05,097 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,097 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-27 08:40:05,108 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-27 08:40:05,108 INFO L377 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 [2019-12-27 08:40:05,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:05,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-27 08:40:05,122 INFO L377 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 [2019-12-27 08:40:05,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:40:05,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:40:05,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-27 08:40:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1568 proven. 813 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-27 08:40:06,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:40:06,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 100] total 127 [2019-12-27 08:40:06,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584900794] [2019-12-27 08:40:06,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-12-27 08:40:06,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:40:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-12-27 08:40:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=14594, Unknown=0, NotChecked=0, Total=16002 [2019-12-27 08:40:06,630 INFO L87 Difference]: Start difference. First operand 22468 states and 50870 transitions. Second operand 127 states. [2019-12-27 08:40:12,760 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 08:40:21,776 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 08:40:23,146 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 08:40:28,697 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 08:40:29,934 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 08:40:30,722 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 08:40:39,307 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 08:40:46,709 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 08:40:59,770 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 08:41:00,049 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 Received shutdown request... [2019-12-27 08:41:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 414 states. [2019-12-27 08:41:01,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:01,520 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 08:41:01,527 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 08:41:01,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:41:01 BasicIcfg [2019-12-27 08:41:01,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:41:01,529 INFO L168 Benchmark]: Toolchain (without parser) took 254470.47 ms. Allocated memory was 138.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 111.3 MB in the end (delta: -9.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,529 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.49 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 131.6 MB in the end (delta: -30.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.68 ms. Allocated memory is still 202.9 MB. Free memory was 131.6 MB in the beginning and 128.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,530 INFO L168 Benchmark]: Boogie Preprocessor took 70.78 ms. Allocated memory is still 202.9 MB. Free memory was 128.9 MB in the beginning and 126.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,530 INFO L168 Benchmark]: RCFGBuilder took 724.36 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 126.3 MB in the beginning and 200.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,531 INFO L168 Benchmark]: TraceAbstraction took 252669.11 ms. Allocated memory was 235.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 200.5 MB in the beginning and 111.3 MB in the end (delta: 89.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 08:41:01,533 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 900.49 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 131.6 MB in the end (delta: -30.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.68 ms. Allocated memory is still 202.9 MB. Free memory was 131.6 MB in the beginning and 128.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.78 ms. Allocated memory is still 202.9 MB. Free memory was 128.9 MB in the beginning and 126.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 724.36 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 126.3 MB in the beginning and 200.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252669.11 ms. Allocated memory was 235.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 200.5 MB in the beginning and 111.3 MB in the end (delta: 89.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 414 states, 127 states before enhancement),while ReachableStatesComputation was computing reachable states (18648 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 414 states, 127 states before enhancement),while ReachableStatesComputation was computing reachable states (18648 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 190 locations, 2 error locations. Result: TIMEOUT, OverallTime: 252.4s, OverallIterations: 19, TraceHistogramMax: 13, AutomataDifference: 143.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4328 SDtfs, 61169 SDslu, 55683 SDs, 0 SdLazy, 28604 SolverSat, 7007 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7460 GetRequests, 5481 SyntacticMatches, 49 SemanticMatches, 1930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301614 ImplicationChecksByTransitivity, 122.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28750occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 56989 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 65.8s SatisfiabilityAnalysisTime, 31.1s InterpolantComputationTime, 9414 NumberOfCodeBlocks, 8944 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 9381 ConstructedInterpolants, 60 QuantifiedInterpolants, 18905800 SizeOfPredicates, 451 NumberOfNonLiveVariables, 7528 ConjunctsInSsa, 765 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 4417/22130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown