/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 11:45:55,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 11:45:55,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 11:45:55,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 11:45:55,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 11:45:55,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 11:45:55,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 11:45:55,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 11:45:55,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 11:45:55,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 11:45:55,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 11:45:55,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 11:45:55,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 11:45:55,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 11:45:55,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 11:45:55,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 11:45:55,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 11:45:55,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 11:45:55,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 11:45:55,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 11:45:55,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 11:45:55,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 11:45:55,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 11:45:55,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 11:45:55,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 11:45:55,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 11:45:55,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 11:45:55,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 11:45:55,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 11:45:55,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 11:45:55,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 11:45:55,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 11:45:55,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 11:45:55,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 11:45:55,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 11:45:55,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 11:45:55,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 11:45:55,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 11:45:55,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 11:45:55,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 11:45:55,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 11:45:55,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 11:45:55,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 11:45:55,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 11:45:55,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 11:45:55,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 11:45:55,584 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 11:45:55,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 11:45:55,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 11:45:55,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 11:45:55,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 11:45:55,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 11:45:55,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 11:45:55,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 11:45:55,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 11:45:55,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 11:45:55,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 11:45:55,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 11:45:55,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 11:45:55,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 11:45:55,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 11:45:55,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 11:45:55,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 11:45:55,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 11:45:55,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 11:45:55,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 11:45:55,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 11:45:55,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 11:45:55,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 11:45:55,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 11:45:55,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 11:45:55,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 11:45:55,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 11:45:55,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 11:45:55,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 11:45:55,893 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 11:45:55,893 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 11:45:55,894 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2019-12-18 11:45:55,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493170032/4b60d37828fe43a08473e9230894aef5/FLAG944c7aa99 [2019-12-18 11:45:56,543 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 11:45:56,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2019-12-18 11:45:56,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493170032/4b60d37828fe43a08473e9230894aef5/FLAG944c7aa99 [2019-12-18 11:45:56,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493170032/4b60d37828fe43a08473e9230894aef5 [2019-12-18 11:45:56,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 11:45:56,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 11:45:56,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 11:45:56,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 11:45:56,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 11:45:56,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:45:56" (1/1) ... [2019-12-18 11:45:56,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b577f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:56, skipping insertion in model container [2019-12-18 11:45:56,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:45:56" (1/1) ... [2019-12-18 11:45:56,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 11:45:56,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 11:45:57,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:45:57,551 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 11:45:57,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:45:57,846 INFO L208 MainTranslator]: Completed translation [2019-12-18 11:45:57,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57 WrapperNode [2019-12-18 11:45:57,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 11:45:57,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 11:45:57,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 11:45:57,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 11:45:57,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:57,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 11:45:58,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 11:45:58,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 11:45:58,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 11:45:58,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (1/1) ... [2019-12-18 11:45:58,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 11:45:58,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 11:45:58,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 11:45:58,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 11:45:58,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (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-18 11:45:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 11:45:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 11:45:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 11:45:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 11:45:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 11:45:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 11:45:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 11:45:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 11:45:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 11:45:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 11:45:58,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 11:45:58,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 11:45:58,214 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 11:45:59,184 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 11:45:59,184 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-18 11:45:59,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:45:59 BoogieIcfgContainer [2019-12-18 11:45:59,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 11:45:59,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 11:45:59,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 11:45:59,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 11:45:59,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:45:56" (1/3) ... [2019-12-18 11:45:59,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435b6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:45:59, skipping insertion in model container [2019-12-18 11:45:59,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:45:57" (2/3) ... [2019-12-18 11:45:59,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435b6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:45:59, skipping insertion in model container [2019-12-18 11:45:59,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:45:59" (3/3) ... [2019-12-18 11:45:59,204 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2019-12-18 11:45:59,215 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 11:45:59,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 11:45:59,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 11:45:59,227 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 11:45:59,288 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,288 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,288 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,288 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,289 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,289 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,289 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,289 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,290 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,290 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,290 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,290 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,291 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,291 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,291 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,291 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,291 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,292 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,292 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,292 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,292 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,295 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,296 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,297 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,297 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,297 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,297 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,298 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,298 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,298 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,298 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,298 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,299 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,299 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,299 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,299 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,299 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,300 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,301 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,301 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,301 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,301 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,301 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,302 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,302 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,302 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,302 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,302 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,303 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,304 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,304 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,304 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,304 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,304 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,305 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,306 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,306 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,307 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,307 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,307 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,308 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,308 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,308 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,308 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,310 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,311 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,311 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,311 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,311 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,311 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,312 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,312 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,312 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,312 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,312 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,313 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,314 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,314 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,314 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,314 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,314 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,315 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,315 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,315 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,315 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,315 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,316 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,316 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,316 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,316 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,316 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,317 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,317 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,317 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,317 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,317 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,318 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,319 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,320 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,320 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,320 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,320 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,320 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,321 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,322 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,322 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,322 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,322 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,322 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,323 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,324 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,325 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,325 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,325 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,325 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,325 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,326 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,326 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,326 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,326 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,326 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,327 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,328 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,328 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,328 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,328 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,328 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,329 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,329 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,329 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,329 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,329 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,330 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,330 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,333 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,335 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,336 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,337 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,338 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,338 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,345 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,346 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,346 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,346 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,346 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,346 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,347 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,347 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,347 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,347 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,347 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,348 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,349 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,351 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,351 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,351 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:45:59,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 11:45:59,393 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:45:59,394 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:45:59,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:45:59,394 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:45:59,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:45:59,394 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:45:59,394 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:45:59,395 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:45:59,412 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions [2019-12-18 11:45:59,414 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-18 11:45:59,507 INFO L126 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-18 11:45:59,508 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:45:59,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-18 11:45:59,542 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-18 11:45:59,587 INFO L126 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-18 11:45:59,588 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:45:59,594 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-18 11:45:59,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2019-12-18 11:45:59,609 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:46:03,154 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-18 11:46:04,152 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-18 11:46:04,319 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-18 11:46:05,198 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-12-18 11:46:05,608 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-12-18 11:46:08,041 WARN L192 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2019-12-18 11:46:08,849 WARN L192 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-12-18 11:46:08,881 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17748 [2019-12-18 11:46:08,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 178 [2019-12-18 11:46:08,885 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-18 11:46:08,922 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2019-12-18 11:46:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2019-12-18 11:46:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 11:46:08,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:08,931 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 11:46:08,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 1 times [2019-12-18 11:46:08,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:08,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268825346] [2019-12-18 11:46:08,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,064 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-18 11:46:09,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268825346] [2019-12-18 11:46:09,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:09,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 11:46:09,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290511076] [2019-12-18 11:46:09,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 11:46:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:09,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 11:46:09,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 11:46:09,090 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2019-12-18 11:46:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:09,138 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2019-12-18 11:46:09,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 11:46:09,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 11:46:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:09,161 INFO L225 Difference]: With dead ends: 715 [2019-12-18 11:46:09,161 INFO L226 Difference]: Without dead ends: 524 [2019-12-18 11:46:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-18 11:46:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-18 11:46:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-18 11:46:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-18 11:46:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2019-12-18 11:46:09,261 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2019-12-18 11:46:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:09,261 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2019-12-18 11:46:09,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 11:46:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2019-12-18 11:46:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:46:09,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:09,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:09,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 1 times [2019-12-18 11:46:09,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:09,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865524968] [2019-12-18 11:46:09,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,443 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-18 11:46:09,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865524968] [2019-12-18 11:46:09,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:09,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:46:09,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441445060] [2019-12-18 11:46:09,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:46:09,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:46:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:46:09,447 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2019-12-18 11:46:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:09,467 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2019-12-18 11:46:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:46:09,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 11:46:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:09,470 INFO L225 Difference]: With dead ends: 236 [2019-12-18 11:46:09,470 INFO L226 Difference]: Without dead ends: 212 [2019-12-18 11:46:09,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 11:46:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-18 11:46:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-12-18 11:46:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-18 11:46:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2019-12-18 11:46:09,482 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2019-12-18 11:46:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:09,484 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2019-12-18 11:46:09,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:46:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2019-12-18 11:46:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 11:46:09,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:09,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:09,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 1 times [2019-12-18 11:46:09,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:09,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381596731] [2019-12-18 11:46:09,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,558 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-18 11:46:09,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381596731] [2019-12-18 11:46:09,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:09,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:46:09,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731432442] [2019-12-18 11:46:09,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:46:09,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:46:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:46:09,560 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2019-12-18 11:46:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:09,586 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2019-12-18 11:46:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:46:09,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 11:46:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:09,589 INFO L225 Difference]: With dead ends: 272 [2019-12-18 11:46:09,589 INFO L226 Difference]: Without dead ends: 272 [2019-12-18 11:46:09,589 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-18 11:46:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-18 11:46:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2019-12-18 11:46:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-18 11:46:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2019-12-18 11:46:09,601 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2019-12-18 11:46:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:09,601 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2019-12-18 11:46:09,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:46:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-12-18 11:46:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 11:46:09,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:09,604 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] [2019-12-18 11:46:09,604 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1197878433, now seen corresponding path program 1 times [2019-12-18 11:46:09,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:09,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194968959] [2019-12-18 11:46:09,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:09,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194968959] [2019-12-18 11:46:09,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:09,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:46:09,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025107003] [2019-12-18 11:46:09,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:46:09,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:46:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:46:09,713 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2019-12-18 11:46:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:09,731 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2019-12-18 11:46:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:46:09,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 11:46:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:09,733 INFO L225 Difference]: With dead ends: 166 [2019-12-18 11:46:09,733 INFO L226 Difference]: Without dead ends: 164 [2019-12-18 11:46:09,733 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-18 11:46:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-18 11:46:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-18 11:46:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-18 11:46:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2019-12-18 11:46:09,740 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2019-12-18 11:46:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:09,740 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2019-12-18 11:46:09,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:46:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2019-12-18 11:46:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 11:46:09,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:09,742 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] [2019-12-18 11:46:09,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:09,743 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 1 times [2019-12-18 11:46:09,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:09,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673268879] [2019-12-18 11:46:09,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,832 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-18 11:46:09,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673268879] [2019-12-18 11:46:09,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578129420] [2019-12-18 11:46:09,834 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-18 11:46:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:09,978 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-18 11:46:09,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:10,005 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-18 11:46:10,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 11:46:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095802205] [2019-12-18 11:46:10,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 11:46:10,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 11:46:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 11:46:10,008 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 5 states. [2019-12-18 11:46:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:10,045 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2019-12-18 11:46:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 11:46:10,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 11:46:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:10,048 INFO L225 Difference]: With dead ends: 240 [2019-12-18 11:46:10,048 INFO L226 Difference]: Without dead ends: 240 [2019-12-18 11:46:10,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 11:46:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-18 11:46:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2019-12-18 11:46:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-18 11:46:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 405 transitions. [2019-12-18 11:46:10,056 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 405 transitions. Word has length 27 [2019-12-18 11:46:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:10,056 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 405 transitions. [2019-12-18 11:46:10,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 11:46:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 405 transitions. [2019-12-18 11:46:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 11:46:10,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:10,058 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-18 11:46:10,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:10,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1561383711, now seen corresponding path program 2 times [2019-12-18 11:46:10,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:10,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703624005] [2019-12-18 11:46:10,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:10,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703624005] [2019-12-18 11:46:10,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220905591] [2019-12-18 11:46:10,358 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-18 11:46:10,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:46:10,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:10,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-18 11:46:10,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:10,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:10,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 11:46:10,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013273286] [2019-12-18 11:46:10,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 11:46:10,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 11:46:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 11:46:10,495 INFO L87 Difference]: Start difference. First operand 204 states and 405 transitions. Second operand 6 states. [2019-12-18 11:46:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:10,554 INFO L93 Difference]: Finished difference Result 280 states and 546 transitions. [2019-12-18 11:46:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 11:46:10,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 11:46:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:10,558 INFO L225 Difference]: With dead ends: 280 [2019-12-18 11:46:10,558 INFO L226 Difference]: Without dead ends: 280 [2019-12-18 11:46:10,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 11:46:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-18 11:46:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2019-12-18 11:46:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-18 11:46:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2019-12-18 11:46:10,566 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 34 [2019-12-18 11:46:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2019-12-18 11:46:10,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 11:46:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2019-12-18 11:46:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 11:46:10,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:10,571 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-18 11:46:10,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:10,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -303137003, now seen corresponding path program 3 times [2019-12-18 11:46:10,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:10,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559671296] [2019-12-18 11:46:10,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:10,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559671296] [2019-12-18 11:46:10,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011647963] [2019-12-18 11:46:10,905 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-18 11:46:11,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 11:46:11,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:11,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-18 11:46:11,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:11,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:11,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 11:46:11,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858245973] [2019-12-18 11:46:11,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 11:46:11,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 11:46:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-18 11:46:11,482 INFO L87 Difference]: Start difference. First operand 244 states and 479 transitions. Second operand 7 states. [2019-12-18 11:46:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:11,530 INFO L93 Difference]: Finished difference Result 320 states and 620 transitions. [2019-12-18 11:46:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 11:46:11,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 11:46:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:11,533 INFO L225 Difference]: With dead ends: 320 [2019-12-18 11:46:11,533 INFO L226 Difference]: Without dead ends: 320 [2019-12-18 11:46:11,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-18 11:46:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-18 11:46:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2019-12-18 11:46:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-18 11:46:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 553 transitions. [2019-12-18 11:46:11,542 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 553 transitions. Word has length 41 [2019-12-18 11:46:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:11,542 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 553 transitions. [2019-12-18 11:46:11,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 11:46:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2019-12-18 11:46:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 11:46:11,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:11,543 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:11,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:11,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1439404639, now seen corresponding path program 4 times [2019-12-18 11:46:11,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:11,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861481767] [2019-12-18 11:46:11,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:11,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861481767] [2019-12-18 11:46:11,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532029827] [2019-12-18 11:46:11,895 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 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-18 11:46:12,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:46:12,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:12,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 11:46:12,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:12,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:12,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 11:46:12,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148842185] [2019-12-18 11:46:12,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 11:46:12,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 11:46:12,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-18 11:46:12,039 INFO L87 Difference]: Start difference. First operand 284 states and 553 transitions. Second operand 8 states. [2019-12-18 11:46:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:12,095 INFO L93 Difference]: Finished difference Result 360 states and 694 transitions. [2019-12-18 11:46:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 11:46:12,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-18 11:46:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:12,098 INFO L225 Difference]: With dead ends: 360 [2019-12-18 11:46:12,099 INFO L226 Difference]: Without dead ends: 360 [2019-12-18 11:46:12,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-18 11:46:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-18 11:46:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2019-12-18 11:46:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-18 11:46:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 627 transitions. [2019-12-18 11:46:12,110 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 627 transitions. Word has length 48 [2019-12-18 11:46:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:12,110 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 627 transitions. [2019-12-18 11:46:12,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 11:46:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 627 transitions. [2019-12-18 11:46:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 11:46:12,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:12,112 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:12,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:12,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2001070123, now seen corresponding path program 5 times [2019-12-18 11:46:12,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:12,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754462135] [2019-12-18 11:46:12,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:12,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754462135] [2019-12-18 11:46:12,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815128758] [2019-12-18 11:46:12,470 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 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-18 11:46:12,657 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-18 11:46:12,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:12,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-18 11:46:12,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:12,716 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-18 11:46:12,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:12,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:12,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:12,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 11:46:12,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:12,767 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-18 11:46:12,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:12,797 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-18 11:46:12,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:12,805 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-18 11:46:12,805 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-18 11:46:12,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:12,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:12,914 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-18 11:46:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:12,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:12,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:12,945 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:12,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 11:46:12,947 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,062 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-18 11:46:13,064 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 11:46:13,065 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-18 11:46:13,066 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 11:46:13,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:13,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:13,132 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-18 11:46:13,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,139 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-18 11:46:13,140 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:13,188 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-18 11:46:13,189 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:46:13,258 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-18 11:46:13,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:13,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 11:46:13,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:13,307 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-18 11:46:13,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:13,319 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-18 11:46:13,319 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 11:46:13,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:13,381 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-18 11:46:13,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,401 INFO L614 ElimStorePlain]: treesize reduction 30, result has 44.4 percent of original size [2019-12-18 11:46:13,402 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-18 11:46:13,402 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 11:46:13,436 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 11:46:13,437 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-18 11:46:13,437 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:13,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:13,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-18 11:46:13,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 11:46:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 11:46:13,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:13,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-12-18 11:46:13,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47425621] [2019-12-18 11:46:13,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 11:46:13,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 11:46:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 11:46:13,463 INFO L87 Difference]: Start difference. First operand 324 states and 627 transitions. Second operand 17 states. [2019-12-18 11:46:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:16,704 INFO L93 Difference]: Finished difference Result 990 states and 1887 transitions. [2019-12-18 11:46:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 11:46:16,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-18 11:46:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:16,710 INFO L225 Difference]: With dead ends: 990 [2019-12-18 11:46:16,711 INFO L226 Difference]: Without dead ends: 990 [2019-12-18 11:46:16,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=738, Invalid=2342, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 11:46:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-18 11:46:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 640. [2019-12-18 11:46:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-18 11:46:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1212 transitions. [2019-12-18 11:46:16,734 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1212 transitions. Word has length 55 [2019-12-18 11:46:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:16,734 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1212 transitions. [2019-12-18 11:46:16,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 11:46:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1212 transitions. [2019-12-18 11:46:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 11:46:16,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:16,736 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:16,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:16,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1721466975, now seen corresponding path program 1 times [2019-12-18 11:46:16,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:16,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296588564] [2019-12-18 11:46:16,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:17,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296588564] [2019-12-18 11:46:17,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241694400] [2019-12-18 11:46:17,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 11:46:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:17,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 11:46:17,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:17,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:17,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 11:46:17,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354751408] [2019-12-18 11:46:17,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 11:46:17,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 11:46:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-18 11:46:17,308 INFO L87 Difference]: Start difference. First operand 640 states and 1212 transitions. Second operand 10 states. [2019-12-18 11:46:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:17,361 INFO L93 Difference]: Finished difference Result 828 states and 1557 transitions. [2019-12-18 11:46:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 11:46:17,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 11:46:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:17,368 INFO L225 Difference]: With dead ends: 828 [2019-12-18 11:46:17,368 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 11:46:17,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-18 11:46:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 11:46:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 740. [2019-12-18 11:46:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-12-18 11:46:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1395 transitions. [2019-12-18 11:46:17,390 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1395 transitions. Word has length 64 [2019-12-18 11:46:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:17,391 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1395 transitions. [2019-12-18 11:46:17,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 11:46:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1395 transitions. [2019-12-18 11:46:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 11:46:17,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:17,393 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:17,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:17,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1068182613, now seen corresponding path program 2 times [2019-12-18 11:46:17,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:17,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843976238] [2019-12-18 11:46:17,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:17,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843976238] [2019-12-18 11:46:17,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426004323] [2019-12-18 11:46:17,719 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 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-18 11:46:17,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:46:17,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:17,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 11:46:17,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:17,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:17,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 11:46:17,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533041040] [2019-12-18 11:46:17,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 11:46:17,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 11:46:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-18 11:46:17,899 INFO L87 Difference]: Start difference. First operand 740 states and 1395 transitions. Second operand 11 states. [2019-12-18 11:46:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:17,966 INFO L93 Difference]: Finished difference Result 928 states and 1740 transitions. [2019-12-18 11:46:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 11:46:17,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-12-18 11:46:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:17,972 INFO L225 Difference]: With dead ends: 928 [2019-12-18 11:46:17,972 INFO L226 Difference]: Without dead ends: 928 [2019-12-18 11:46:17,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-18 11:46:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-12-18 11:46:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 840. [2019-12-18 11:46:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 11:46:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1578 transitions. [2019-12-18 11:46:17,995 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1578 transitions. Word has length 71 [2019-12-18 11:46:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:17,995 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1578 transitions. [2019-12-18 11:46:17,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 11:46:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1578 transitions. [2019-12-18 11:46:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-18 11:46:17,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:17,999 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:18,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:18,211 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1341473003, now seen corresponding path program 3 times [2019-12-18 11:46:18,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:18,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914088927] [2019-12-18 11:46:18,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:18,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914088927] [2019-12-18 11:46:18,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162190970] [2019-12-18 11:46:18,396 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 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-18 11:46:19,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-18 11:46:19,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:19,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-18 11:46:19,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:19,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 287 [2019-12-18 11:46:19,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,602 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 30 [2019-12-18 11:46:19,602 INFO L614 ElimStorePlain]: treesize reduction 3665, result has 1.1 percent of original size [2019-12-18 11:46:19,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,604 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:4 [2019-12-18 11:46:19,636 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-18 11:46:19,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-18 11:46:19,659 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-18 11:46:19,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,669 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-18 11:46:19,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-12-18 11:46:19,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:19,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,719 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-18 11:46:19,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,753 INFO L614 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2019-12-18 11:46:19,753 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-18 11:46:19,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-18 11:46:19,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:19,781 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-18 11:46:19,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,792 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-18 11:46:19,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-12-18 11:46:19,826 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 34 treesize of output 18 [2019-12-18 11:46:19,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,833 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-18 11:46:19,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2019-12-18 11:46:19,854 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-18 11:46:19,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:19,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,870 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-18 11:46:19,871 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2019-12-18 11:46:19,912 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:19,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:19,926 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-18 11:46:19,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:19,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 11:46:19,968 INFO L614 ElimStorePlain]: treesize reduction 92, result has 26.4 percent of original size [2019-12-18 11:46:19,968 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-18 11:46:19,969 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-12-18 11:46:20,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:20,017 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-18 11:46:20,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:20,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:20,027 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-18 11:46:20,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-18 11:46:20,031 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-18 11:46:20,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:20,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:20,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:20,033 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:1 [2019-12-18 11:46:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 78 proven. 35 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-18 11:46:20,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:20,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 11:46:20,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531116597] [2019-12-18 11:46:20,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 11:46:20,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 11:46:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-18 11:46:20,049 INFO L87 Difference]: Start difference. First operand 840 states and 1578 transitions. Second operand 21 states. [2019-12-18 11:46:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:22,703 INFO L93 Difference]: Finished difference Result 1310 states and 2402 transitions. [2019-12-18 11:46:22,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-18 11:46:22,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2019-12-18 11:46:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:22,710 INFO L225 Difference]: With dead ends: 1310 [2019-12-18 11:46:22,710 INFO L226 Difference]: Without dead ends: 1310 [2019-12-18 11:46:22,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1527, Invalid=4173, Unknown=0, NotChecked=0, Total=5700 [2019-12-18 11:46:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-18 11:46:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 885. [2019-12-18 11:46:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-18 11:46:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1627 transitions. [2019-12-18 11:46:22,735 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1627 transitions. Word has length 79 [2019-12-18 11:46:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:22,736 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1627 transitions. [2019-12-18 11:46:22,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 11:46:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1627 transitions. [2019-12-18 11:46:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-18 11:46:22,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:22,739 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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] [2019-12-18 11:46:22,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:22,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1687151893, now seen corresponding path program 4 times [2019-12-18 11:46:22,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:22,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801089719] [2019-12-18 11:46:22,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:23,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801089719] [2019-12-18 11:46:23,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016342959] [2019-12-18 11:46:23,119 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 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-18 11:46:24,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:46:24,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:24,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 11:46:24,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:24,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:24,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-18 11:46:24,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414173646] [2019-12-18 11:46:24,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 11:46:24,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 11:46:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-18 11:46:24,542 INFO L87 Difference]: Start difference. First operand 885 states and 1627 transitions. Second operand 13 states. [2019-12-18 11:46:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:24,624 INFO L93 Difference]: Finished difference Result 1057 states and 1936 transitions. [2019-12-18 11:46:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 11:46:24,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2019-12-18 11:46:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:24,629 INFO L225 Difference]: With dead ends: 1057 [2019-12-18 11:46:24,629 INFO L226 Difference]: Without dead ends: 1057 [2019-12-18 11:46:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-18 11:46:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-18 11:46:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 977. [2019-12-18 11:46:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-12-18 11:46:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1792 transitions. [2019-12-18 11:46:24,649 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1792 transitions. Word has length 89 [2019-12-18 11:46:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:24,650 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1792 transitions. [2019-12-18 11:46:24,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 11:46:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1792 transitions. [2019-12-18 11:46:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 11:46:24,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:24,653 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:24,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:24,857 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 792310527, now seen corresponding path program 5 times [2019-12-18 11:46:24,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:24,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767544528] [2019-12-18 11:46:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:25,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767544528] [2019-12-18 11:46:25,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827781437] [2019-12-18 11:46:25,001 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 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-18 11:46:26,178 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-18 11:46:26,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:26,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 112 conjunts are in the unsatisfiable core [2019-12-18 11:46:26,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:26,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-18 11:46:26,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,238 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-18 11:46:26,239 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-18 11:46:26,262 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-18 11:46:26,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,265 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,265 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-12-18 11:46:26,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,311 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-18 11:46:26,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,341 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-18 11:46:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,342 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-18 11:46:26,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-18 11:46:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,468 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-18 11:46:26,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,473 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:26,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,493 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-18 11:46:26,494 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,589 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 11:46:26,590 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-18 11:46:26,591 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 11:46:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,655 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-18 11:46:26,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:26,662 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-18 11:46:26,663 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,696 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-18 11:46:26,696 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:46:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,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, 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-18 11:46:26,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,769 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-18 11:46:26,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,791 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-18 11:46:26,792 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-18 11:46:26,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:26,859 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-18 11:46:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,870 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-18 11:46:26,871 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:26,941 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 11:46:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:26,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 11:46:26,944 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 11:46:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,037 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-18 11:46:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:27,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,066 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-18 11:46:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,067 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,164 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 11:46:27,165 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-18 11:46:27,166 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 11:46:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,225 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-18 11:46:27,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:27,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-18 11:46:27,241 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,273 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-18 11:46:27,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:46:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,357 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-18 11:46:27,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,363 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-18 11:46:27,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,381 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-18 11:46:27,381 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-18 11:46:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,433 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-18 11:46:27,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,459 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,460 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-18 11:46:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,461 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,536 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 11:46:27,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 11:46:27,539 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 11:46:27,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,641 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-18 11:46:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:27,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,667 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-18 11:46:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,668 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,764 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 11:46:27,764 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-18 11:46:27,765 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 11:46:27,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:27,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:27,828 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-18 11:46:27,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,834 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-18 11:46:27,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,867 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-18 11:46:27,868 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:46:27,947 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-18 11:46:27,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:27,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:46:27,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 11:46:27,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:27,997 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-18 11:46:27,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,011 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-18 11:46:28,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 11:46:28,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:28,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,103 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-18 11:46:28,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,155 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 11:46:28,156 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-18 11:46:28,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 11:46:28,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:28,209 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-18 11:46:28,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,231 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-18 11:46:28,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 11:46:28,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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 11:46:28,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,311 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-18 11:46:28,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 11:46:28,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:28,355 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-18 11:46:28,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,375 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-18 11:46:28,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 11:46:28,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:46:28,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,509 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-18 11:46:28,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:28,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,562 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 11:46:28,563 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-18 11:46:28,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 11:46:28,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:28,625 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-18 11:46:28,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,643 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-18 11:46:28,644 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 11:46:28,745 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-18 11:46:28,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,761 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-18 11:46:28,762 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 11:46:28,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:46:28,804 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-18 11:46:28,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,813 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-18 11:46:28,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 11:46:28,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,889 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-18 11:46:28,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:46:28,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,911 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-18 11:46:28,911 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-18 11:46:28,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 11:46:28,947 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 11:46:28,948 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-18 11:46:28,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:46:28,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:46:28,955 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-18 11:46:28,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 11:46:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 228 proven. 54 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 11:46:29,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:29,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 42 [2019-12-18 11:46:29,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796155194] [2019-12-18 11:46:29,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-18 11:46:29,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:29,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-18 11:46:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 11:46:29,004 INFO L87 Difference]: Start difference. First operand 977 states and 1792 transitions. Second operand 42 states. [2019-12-18 11:46:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:45,666 INFO L93 Difference]: Finished difference Result 3677 states and 6688 transitions. [2019-12-18 11:46:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2019-12-18 11:46:45,666 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-12-18 11:46:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:45,681 INFO L225 Difference]: With dead ends: 3677 [2019-12-18 11:46:45,682 INFO L226 Difference]: Without dead ends: 3677 [2019-12-18 11:46:45,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25986 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=8601, Invalid=51179, Unknown=0, NotChecked=0, Total=59780 [2019-12-18 11:46:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2019-12-18 11:46:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2490. [2019-12-18 11:46:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-12-18 11:46:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4493 transitions. [2019-12-18 11:46:45,801 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4493 transitions. Word has length 96 [2019-12-18 11:46:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:45,802 INFO L462 AbstractCegarLoop]: Abstraction has 2490 states and 4493 transitions. [2019-12-18 11:46:45,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-18 11:46:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4493 transitions. [2019-12-18 11:46:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 11:46:45,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:45,810 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:46,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:46,024 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1634230719, now seen corresponding path program 6 times [2019-12-18 11:46:46,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:46,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788661068] [2019-12-18 11:46:46,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:46,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788661068] [2019-12-18 11:46:46,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950869742] [2019-12-18 11:46:46,230 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 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-18 11:47:06,616 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-18 11:47:06,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:47:06,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-18 11:47:06,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:47:06,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 223 [2019-12-18 11:47:06,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,706 INFO L614 ElimStorePlain]: treesize reduction 184, result has 9.8 percent of original size [2019-12-18 11:47:06,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2019-12-18 11:47:06,739 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-18 11:47:06,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:06,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 11:47:06,769 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-18 11:47:06,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:06,779 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-18 11:47:06,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 11:47:06,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:06,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:06,845 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-18 11:47:06,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,879 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 11:47:06,879 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-18 11:47:06,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 11:47:06,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:06,917 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-18 11:47:06,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:06,929 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-18 11:47:06,929 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 11:47:06,962 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 34 treesize of output 18 [2019-12-18 11:47:06,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:06,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:06,973 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-18 11:47:06,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-12-18 11:47:06,994 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-18 11:47:06,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,003 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-18 11:47:07,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 11:47:07,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:07,051 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,051 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-18 11:47:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:07,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,092 INFO L614 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size [2019-12-18 11:47:07,093 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-18 11:47:07,093 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 11:47:07,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:07,124 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-18 11:47:07,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,139 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-18 11:47:07,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 11:47:07,172 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 34 treesize of output 18 [2019-12-18 11:47:07,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,181 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-18 11:47:07,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-12-18 11:47:07,203 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-18 11:47:07,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,211 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-18 11:47:07,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-18 11:47:07,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:07,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,279 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 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-18 11:47:07,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:07,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:07,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,324 INFO L614 ElimStorePlain]: treesize reduction 110, result has 24.7 percent of original size [2019-12-18 11:47:07,325 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-18 11:47:07,325 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2019-12-18 11:47:07,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:07,389 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-18 11:47:07,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,398 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-18 11:47:07,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-18 11:47:07,401 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-18 11:47:07,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:07,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:07,403 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-18 11:47:07,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-12-18 11:47:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 227 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-18 11:47:07,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:47:07,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2019-12-18 11:47:07,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114895473] [2019-12-18 11:47:07,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-18 11:47:07,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:47:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-18 11:47:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2019-12-18 11:47:07,423 INFO L87 Difference]: Start difference. First operand 2490 states and 4493 transitions. Second operand 28 states. [2019-12-18 11:47:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:47:12,748 INFO L93 Difference]: Finished difference Result 2569 states and 4588 transitions. [2019-12-18 11:47:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-12-18 11:47:12,748 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2019-12-18 11:47:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:47:12,760 INFO L225 Difference]: With dead ends: 2569 [2019-12-18 11:47:12,760 INFO L226 Difference]: Without dead ends: 2569 [2019-12-18 11:47:12,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7137 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4265, Invalid=13291, Unknown=0, NotChecked=0, Total=17556 [2019-12-18 11:47:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-12-18 11:47:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1458. [2019-12-18 11:47:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-12-18 11:47:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2635 transitions. [2019-12-18 11:47:12,799 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2635 transitions. Word has length 104 [2019-12-18 11:47:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:47:12,800 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2635 transitions. [2019-12-18 11:47:12,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-18 11:47:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2635 transitions. [2019-12-18 11:47:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-18 11:47:12,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:47:12,804 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 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] [2019-12-18 11:47:13,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:47:13,014 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:47:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:47:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1180971947, now seen corresponding path program 7 times [2019-12-18 11:47:13,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:47:13,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970833520] [2019-12-18 11:47:13,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:47:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:47:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:47:13,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970833520] [2019-12-18 11:47:13,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344587668] [2019-12-18 11:47:13,225 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 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-18 11:47:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:47:13,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 11:47:13,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:47:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:47:13,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:47:13,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-18 11:47:13,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862743235] [2019-12-18 11:47:13,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 11:47:13,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:47:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 11:47:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-18 11:47:13,403 INFO L87 Difference]: Start difference. First operand 1458 states and 2635 transitions. Second operand 16 states. [2019-12-18 11:47:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:47:13,505 INFO L93 Difference]: Finished difference Result 1690 states and 3049 transitions. [2019-12-18 11:47:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 11:47:13,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 113 [2019-12-18 11:47:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:47:13,514 INFO L225 Difference]: With dead ends: 1690 [2019-12-18 11:47:13,514 INFO L226 Difference]: Without dead ends: 1690 [2019-12-18 11:47:13,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-18 11:47:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-12-18 11:47:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1582. [2019-12-18 11:47:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2019-12-18 11:47:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2856 transitions. [2019-12-18 11:47:13,541 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2856 transitions. Word has length 113 [2019-12-18 11:47:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:47:13,541 INFO L462 AbstractCegarLoop]: Abstraction has 1582 states and 2856 transitions. [2019-12-18 11:47:13,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 11:47:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2856 transitions. [2019-12-18 11:47:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-18 11:47:13,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:47:13,545 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:47:13,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:47:13,757 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:47:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:47:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2141456319, now seen corresponding path program 8 times [2019-12-18 11:47:13,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:47:13,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877363356] [2019-12-18 11:47:13,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:47:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:47:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:47:13,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877363356] [2019-12-18 11:47:13,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096634606] [2019-12-18 11:47:13,976 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 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-18 11:47:14,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:47:14,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:47:14,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-18 11:47:14,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:47:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:47:14,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:47:14,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-18 11:47:14,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733685806] [2019-12-18 11:47:14,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 11:47:14,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:47:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 11:47:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-18 11:47:14,311 INFO L87 Difference]: Start difference. First operand 1582 states and 2856 transitions. Second operand 17 states. [2019-12-18 11:47:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:47:14,440 INFO L93 Difference]: Finished difference Result 1814 states and 3270 transitions. [2019-12-18 11:47:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 11:47:14,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-12-18 11:47:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:47:14,449 INFO L225 Difference]: With dead ends: 1814 [2019-12-18 11:47:14,449 INFO L226 Difference]: Without dead ends: 1814 [2019-12-18 11:47:14,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-18 11:47:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-12-18 11:47:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1706. [2019-12-18 11:47:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-18 11:47:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3077 transitions. [2019-12-18 11:47:14,481 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3077 transitions. Word has length 120 [2019-12-18 11:47:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:47:14,482 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3077 transitions. [2019-12-18 11:47:14,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 11:47:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3077 transitions. [2019-12-18 11:47:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-18 11:47:14,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:47:14,487 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:47:14,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:47:14,691 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:47:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:47:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 702742271, now seen corresponding path program 9 times [2019-12-18 11:47:14,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:47:14,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870618554] [2019-12-18 11:47:14,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:47:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:47:15,003 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-18 11:47:15,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870618554] [2019-12-18 11:47:15,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204870141] [2019-12-18 11:47:15,003 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 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-18 11:47:19,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-18 11:47:19,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:47:19,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-18 11:47:19,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:47:19,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 661 treesize of output 679 [2019-12-18 11:47:19,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,454 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 32 [2019-12-18 11:47:19,455 INFO L614 ElimStorePlain]: treesize reduction 7746, result has 0.6 percent of original size [2019-12-18 11:47:19,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:13 [2019-12-18 11:47:19,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 11:47:19,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-18 11:47:19,564 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 25 treesize of output 24 [2019-12-18 11:47:19,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,581 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-18 11:47:19,581 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-12-18 11:47:19,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:19,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,653 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 11:47:19,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,699 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.3 percent of original size [2019-12-18 11:47:19,699 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-18 11:47:19,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-12-18 11:47:19,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:19,747 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 25 treesize of output 24 [2019-12-18 11:47:19,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,770 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-18 11:47:19,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-12-18 11:47:19,814 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 34 treesize of output 18 [2019-12-18 11:47:19,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,825 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-18 11:47:19,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2019-12-18 11:47:19,854 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 25 treesize of output 24 [2019-12-18 11:47:19,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,865 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-18 11:47:19,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-12-18 11:47:19,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:19,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:19,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, 2 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-18 11:47:19,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:19,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:19,961 INFO L614 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size [2019-12-18 11:47:19,962 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-18 11:47:19,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-12-18 11:47:19,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:19,998 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 25 treesize of output 24 [2019-12-18 11:47:19,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,012 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-18 11:47:20,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-12-18 11:47:20,071 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 31 treesize of output 15 [2019-12-18 11:47:20,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,080 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,080 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-12-18 11:47:20,112 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 25 treesize of output 24 [2019-12-18 11:47:20,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,123 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-18 11:47:20,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:14 [2019-12-18 11:47:20,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:47:20,185 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 0 case distinctions, treesize of input 30 treesize of output 23 [2019-12-18 11:47:20,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,201 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-18 11:47:20,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-12-18 11:47:20,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,271 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 59 [2019-12-18 11:47:20,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:20,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:20,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:47:20,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,322 INFO L614 ElimStorePlain]: treesize reduction 92, result has 32.4 percent of original size [2019-12-18 11:47:20,322 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-18 11:47:20,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:27 [2019-12-18 11:47:20,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:47:20,380 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-18 11:47:20,381 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,394 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-18 11:47:20,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:27 [2019-12-18 11:47:20,399 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-18 11:47:20,399 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:47:20,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:47:20,401 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-18 11:47:20,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2019-12-18 11:47:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 222 proven. 73 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-12-18 11:47:20,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:47:20,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2019-12-18 11:47:20,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042527258] [2019-12-18 11:47:20,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 11:47:20,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:47:20,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 11:47:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2019-12-18 11:47:20,474 INFO L87 Difference]: Start difference. First operand 1706 states and 3077 transitions. Second operand 32 states. [2019-12-18 11:47:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:47:36,187 INFO L93 Difference]: Finished difference Result 3757 states and 6689 transitions. [2019-12-18 11:47:36,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-12-18 11:47:36,188 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2019-12-18 11:47:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:47:36,202 INFO L225 Difference]: With dead ends: 3757 [2019-12-18 11:47:36,202 INFO L226 Difference]: Without dead ends: 3757 [2019-12-18 11:47:36,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30657 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=12002, Invalid=53278, Unknown=0, NotChecked=0, Total=65280 [2019-12-18 11:47:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-12-18 11:47:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 1656. [2019-12-18 11:47:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2019-12-18 11:47:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 3002 transitions. [2019-12-18 11:47:36,245 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 3002 transitions. Word has length 128 [2019-12-18 11:47:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:47:36,245 INFO L462 AbstractCegarLoop]: Abstraction has 1656 states and 3002 transitions. [2019-12-18 11:47:36,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 11:47:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 3002 transitions. [2019-12-18 11:47:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-18 11:47:36,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:47:36,250 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 11, 11, 11, 11, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:47:36,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:47:36,456 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:47:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:47:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 883192735, now seen corresponding path program 10 times [2019-12-18 11:47:36,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:47:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74476913] [2019-12-18 11:47:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:47:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:47:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:47:36,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74476913] [2019-12-18 11:47:36,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487394864] [2019-12-18 11:47:36,764 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:48:02,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:48:02,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:48:02,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-18 11:48:02,291 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:48:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:48:02,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:48:02,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-18 11:48:02,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220084027] [2019-12-18 11:48:02,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 11:48:02,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:48:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 11:48:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-18 11:48:02,328 INFO L87 Difference]: Start difference. First operand 1656 states and 3002 transitions. Second operand 19 states. [2019-12-18 11:48:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:48:02,446 INFO L93 Difference]: Finished difference Result 1888 states and 3416 transitions. [2019-12-18 11:48:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 11:48:02,447 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 136 [2019-12-18 11:48:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:48:02,470 INFO L225 Difference]: With dead ends: 1888 [2019-12-18 11:48:02,473 INFO L226 Difference]: Without dead ends: 1888 [2019-12-18 11:48:02,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-18 11:48:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2019-12-18 11:48:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1780. [2019-12-18 11:48:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-12-18 11:48:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 3223 transitions. [2019-12-18 11:48:02,526 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 3223 transitions. Word has length 136 [2019-12-18 11:48:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:48:02,527 INFO L462 AbstractCegarLoop]: Abstraction has 1780 states and 3223 transitions. [2019-12-18 11:48:02,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 11:48:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3223 transitions. [2019-12-18 11:48:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-18 11:48:02,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:48:02,535 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 12, 12, 12, 12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:48:02,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:48:02,745 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:48:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:48:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash 851330655, now seen corresponding path program 11 times [2019-12-18 11:48:02,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:48:02,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145117946] [2019-12-18 11:48:02,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:48:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:48:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:48:03,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145117946] [2019-12-18 11:48:03,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166309129] [2019-12-18 11:48:03,142 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:48:05,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-18 11:48:05,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:48:05,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 146 conjunts are in the unsatisfiable core [2019-12-18 11:48:05,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:48:05,420 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-18 11:48:05,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 11:48:05,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,459 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-18 11:48:05,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,496 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-18 11:48:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:05,498 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-18 11:48:05,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-18 11:48:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:05,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:05,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:05,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,607 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-18 11:48:05,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,672 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-18 11:48:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:05,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,765 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 11:48:05,765 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-18 11:48:05,765 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 11:48:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:05,817 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-18 11:48:05,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:05,830 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-18 11:48:05,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,864 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-18 11:48:05,864 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:48:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:05,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-18 11:48:05,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,936 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-18 11:48:05,937 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:05,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:05,958 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-18 11:48:05,959 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-18 11:48:05,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,002 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-18 11:48:06,003 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,027 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-18 11:48:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,028 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,101 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 11:48:06,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 11:48:06,103 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 11:48:06,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,195 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:06,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:06,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,218 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-18 11:48:06,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,244 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-18 11:48:06,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,245 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,340 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 11:48:06,341 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-18 11:48:06,341 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 11:48:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:06,403 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-18 11:48:06,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,408 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-18 11:48:06,408 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,442 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-18 11:48:06,442 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:48:06,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,507 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-18 11:48:06,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,512 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-18 11:48:06,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,533 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-18 11:48:06,533 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-18 11:48:06,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,624 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-18 11:48:06,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,629 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-18 11:48:06,630 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,701 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 11:48:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 11:48:06,704 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 11:48:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:06,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:06,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,840 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-18 11:48:06,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:06,870 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-18 11:48:06,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:06,871 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:06,975 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-18 11:48:06,975 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 11:48:06,976 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-18 11:48:06,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 11:48:07,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:07,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-18 11:48:07,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,059 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-18 11:48:07,059 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,092 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-18 11:48:07,092 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:48:07,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,163 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-18 11:48:07,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,169 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-18 11:48:07,169 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,187 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-18 11:48:07,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-18 11:48:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,254 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-18 11:48:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,255 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,261 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-18 11:48:07,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,336 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 11:48:07,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 11:48:07,339 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 11:48:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:07,442 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:07,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,466 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-18 11:48:07,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,487 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-18 11:48:07,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,584 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 11:48:07,585 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-18 11:48:07,585 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 11:48:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:07,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:07,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-18 11:48:07,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,657 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-18 11:48:07,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,689 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-18 11:48:07,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 11:48:07,764 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-18 11:48:07,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 11:48:07,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:07,813 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-18 11:48:07,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,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-18 11:48:07,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 11:48:07,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:07,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:07,941 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-18 11:48:07,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:07,983 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 11:48:07,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-18 11:48:07,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 11:48:08,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:08,043 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-18 11:48:08,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,061 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-18 11:48:08,061 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 11:48:08,115 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-18 11:48:08,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,129 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-18 11:48:08,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 11:48:08,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:08,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 25 treesize of output 24 [2019-12-18 11:48:08,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,185 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-18 11:48:08,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 11:48:08,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:08,294 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,294 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-18 11:48:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:08,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,345 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 11:48:08,346 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-18 11:48:08,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 11:48:08,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:08,407 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-18 11:48:08,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,426 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-18 11:48:08,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 11:48:08,489 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-18 11:48:08,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,503 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-18 11:48:08,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 11:48:08,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:08,547 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-18 11:48:08,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,565 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-18 11:48:08,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 11:48:08,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:08,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,690 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-18 11:48:08,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:08,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,739 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 11:48:08,740 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-18 11:48:08,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 11:48:08,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:08,802 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-18 11:48:08,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,819 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-18 11:48:08,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 11:48:08,941 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-18 11:48:08,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:08,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:08,956 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-18 11:48:08,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 11:48:09,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:09,022 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-18 11:48:09,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:09,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:09,034 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-18 11:48:09,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 11:48:09,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 11:48:09,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:09,144 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 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-18 11:48:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 11:48:09,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:09,178 INFO L614 ElimStorePlain]: treesize reduction 110, result has 23.1 percent of original size [2019-12-18 11:48:09,178 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-18 11:48:09,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-18 11:48:09,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 11:48:09,213 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-18 11:48:09,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:09,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:09,221 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-18 11:48:09,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-18 11:48:09,224 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-18 11:48:09,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 11:48:09,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 11:48:09,226 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-18 11:48:09,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-18 11:48:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 640 proven. 101 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-18 11:48:09,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:48:09,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 39] total 56 [2019-12-18 11:48:09,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938248125] [2019-12-18 11:48:09,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-18 11:48:09,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:48:09,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-18 11:48:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2537, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 11:48:09,302 INFO L87 Difference]: Start difference. First operand 1780 states and 3223 transitions. Second operand 56 states. [2019-12-18 11:48:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:48:40,858 INFO L93 Difference]: Finished difference Result 7258 states and 12982 transitions. [2019-12-18 11:48:40,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 378 states. [2019-12-18 11:48:40,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 144 [2019-12-18 11:48:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:48:40,876 INFO L225 Difference]: With dead ends: 7258 [2019-12-18 11:48:40,876 INFO L226 Difference]: Without dead ends: 7258 [2019-12-18 11:48:40,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 456 SyntacticMatches, 4 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77032 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=22305, Invalid=144567, Unknown=0, NotChecked=0, Total=166872 [2019-12-18 11:48:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-12-18 11:48:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 5330. [2019-12-18 11:48:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5330 states. [2019-12-18 11:48:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 9487 transitions. [2019-12-18 11:48:41,053 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 9487 transitions. Word has length 144 [2019-12-18 11:48:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:48:41,053 INFO L462 AbstractCegarLoop]: Abstraction has 5330 states and 9487 transitions. [2019-12-18 11:48:41,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-18 11:48:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 9487 transitions. [2019-12-18 11:48:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-18 11:48:41,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:48:41,066 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 13, 13, 13, 13, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:48:41,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:48:41,274 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:48:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:48:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2099551841, now seen corresponding path program 12 times [2019-12-18 11:48:41,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:48:41,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540500361] [2019-12-18 11:48:41,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:48:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:48:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 0 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:48:41,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540500361] [2019-12-18 11:48:41,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679060501] [2019-12-18 11:48:41,590 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown