/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:25:37,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:25:37,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:25:37,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:25:37,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:25:37,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:25:37,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:25:37,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:25:37,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:25:37,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:25:37,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:25:37,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:25:37,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:25:37,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:25:37,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:25:37,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:25:37,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:25:37,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:25:37,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:25:37,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:25:37,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:25:37,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:25:37,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:25:37,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:25:37,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:25:37,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:25:37,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:25:37,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:25:37,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:25:37,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:25:37,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:25:37,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:25:37,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:25:37,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:25:37,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:25:37,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:25:37,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:25:37,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:25:37,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:25:37,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:25:37,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:25:37,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:25:37,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:25:37,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:25:37,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:25:37,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:25:37,646 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:25:37,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:25:37,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:25:37,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:25:37,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:25:37,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:25:37,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:25:37,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:25:37,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:25:37,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:25:37,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:25:37,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:25:37,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:25:37,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:25:37,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:25:37,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:25:37,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:25:37,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:25:37,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:25:37,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:25:37,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:25:37,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:25:37,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:25:37,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:25:37,957 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:25:37,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 19:25:38,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f495ba8e/c59b27b468164b8a919c1488aee156d8/FLAG218041d3d [2019-12-18 19:25:38,586 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:25:38,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 19:25:38,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f495ba8e/c59b27b468164b8a919c1488aee156d8/FLAG218041d3d [2019-12-18 19:25:38,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f495ba8e/c59b27b468164b8a919c1488aee156d8 [2019-12-18 19:25:38,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:25:38,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:25:38,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:38,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:25:38,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:25:38,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:38" (1/1) ... [2019-12-18 19:25:38,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:38, skipping insertion in model container [2019-12-18 19:25:38,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:38" (1/1) ... [2019-12-18 19:25:38,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:25:38,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:25:39,118 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:39,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:39,446 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:25:39,461 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:39,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:39,616 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:25:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39 WrapperNode [2019-12-18 19:25:39,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:39,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:39,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:25:39,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:25:39,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:39,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:25:39,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:25:39,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:25:39,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (1/1) ... [2019-12-18 19:25:39,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:25:39,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:25:39,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:25:39,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:25:39,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (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 19:25:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-18 19:25:39,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-18 19:25:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:25:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:25:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:25:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:25:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:25:39,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:25:39,802 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 19:25:40,363 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:25:40,363 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-18 19:25:40,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:40 BoogieIcfgContainer [2019-12-18 19:25:40,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:25:40,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:25:40,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:25:40,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:25:40,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:25:38" (1/3) ... [2019-12-18 19:25:40,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cdec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:40, skipping insertion in model container [2019-12-18 19:25:40,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:39" (2/3) ... [2019-12-18 19:25:40,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cdec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:40, skipping insertion in model container [2019-12-18 19:25:40,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:40" (3/3) ... [2019-12-18 19:25:40,380 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-18 19:25:40,389 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:25:40,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:25:40,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-18 19:25:40,396 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:25:40,426 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,426 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,427 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,427 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,427 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,428 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,428 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,428 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,429 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,429 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,429 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,430 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,430 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,430 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,431 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,431 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,431 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,431 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,432 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,432 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,432 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,433 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,433 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,433 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,434 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,434 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,434 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,434 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,434 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,435 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,435 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,435 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,435 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,436 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,436 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,436 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,436 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,436 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,437 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,437 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,437 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,437 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,438 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,438 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,438 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,438 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,439 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,439 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,439 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,439 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,440 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,440 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,440 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,440 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,441 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,441 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,441 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,441 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,442 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,442 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,442 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,442 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,443 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,443 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,443 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,443 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,444 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,444 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,444 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,444 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,445 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,445 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,445 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,446 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,446 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,446 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,446 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,446 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,447 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,447 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,447 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,447 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,448 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,448 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,448 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,448 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,449 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,449 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,449 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,449 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,449 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,450 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,450 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,450 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,450 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,451 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,451 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,451 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,451 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,452 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,452 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,452 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,452 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,453 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,453 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,453 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,453 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,453 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,454 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,454 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,454 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,455 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,455 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,455 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,455 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,456 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,456 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,456 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,456 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,457 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,457 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,457 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,457 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,458 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,458 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,458 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,459 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,459 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,463 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,463 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,464 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,464 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,464 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,464 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,465 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,465 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,465 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,465 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,466 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,466 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,466 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,466 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,467 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,467 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,467 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,467 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,468 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,468 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,468 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,468 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,469 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,469 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,469 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,469 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,470 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,470 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,470 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:40,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 19:25:40,526 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:25:40,526 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:25:40,526 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:25:40,527 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:25:40,527 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:25:40,527 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:25:40,527 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:25:40,527 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:25:40,551 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-18 19:25:40,554 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 19:25:40,633 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 19:25:40,633 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:40,642 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 19:25:40,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 19:25:40,680 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 19:25:40,681 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:40,685 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 19:25:40,694 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-18 19:25:40,695 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:25:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:43,312 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-18 19:25:44,116 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5902 [2019-12-18 19:25:44,116 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 19:25:44,120 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-18 19:25:44,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-18 19:25:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-18 19:25:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:25:44,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:44,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:25:44,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash 486263513, now seen corresponding path program 1 times [2019-12-18 19:25:44,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:44,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512781257] [2019-12-18 19:25:44,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:44,389 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 19:25:44,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512781257] [2019-12-18 19:25:44,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:44,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:25:44,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247995347] [2019-12-18 19:25:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 19:25:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 19:25:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 19:25:44,418 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-18 19:25:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:44,458 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-18 19:25:44,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 19:25:44,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-18 19:25:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:44,486 INFO L225 Difference]: With dead ends: 139 [2019-12-18 19:25:44,486 INFO L226 Difference]: Without dead ends: 128 [2019-12-18 19:25:44,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 19:25:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-18 19:25:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-18 19:25:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-18 19:25:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-18 19:25:44,540 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-18 19:25:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:44,540 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-18 19:25:44,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 19:25:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-18 19:25:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 19:25:44,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:44,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 19:25:44,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2105704442, now seen corresponding path program 1 times [2019-12-18 19:25:44,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:44,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997710633] [2019-12-18 19:25:44,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:44,601 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 19:25:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997710633] [2019-12-18 19:25:44,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:44,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:25:44,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130307097] [2019-12-18 19:25:44,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:25:44,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:25:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:25:44,605 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-18 19:25:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:44,625 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-18 19:25:44,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:25:44,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-18 19:25:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:44,629 INFO L225 Difference]: With dead ends: 200 [2019-12-18 19:25:44,629 INFO L226 Difference]: Without dead ends: 200 [2019-12-18 19:25:44,630 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 19:25:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-18 19:25:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-18 19:25:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-18 19:25:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-18 19:25:44,651 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-18 19:25:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:44,652 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-18 19:25:44,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:25:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-18 19:25:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 19:25:44,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:44,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:44,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 282683680, now seen corresponding path program 1 times [2019-12-18 19:25:44,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:44,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138406111] [2019-12-18 19:25:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:44,878 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 19:25:44,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138406111] [2019-12-18 19:25:44,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:44,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:25:44,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210352958] [2019-12-18 19:25:44,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:25:44,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:25:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:25:44,880 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-18 19:25:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:45,214 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-18 19:25:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:25:45,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 19:25:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:45,216 INFO L225 Difference]: With dead ends: 181 [2019-12-18 19:25:45,216 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 19:25:45,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:25:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 19:25:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 19:25:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 19:25:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-18 19:25:45,233 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-18 19:25:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:45,233 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-18 19:25:45,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:25:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-18 19:25:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:25:45,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:45,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:45,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1366120806, now seen corresponding path program 1 times [2019-12-18 19:25:45,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:45,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321651624] [2019-12-18 19:25:45,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:45,856 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 19:25:45,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321651624] [2019-12-18 19:25:45,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:45,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:25:45,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947766866] [2019-12-18 19:25:45,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:25:45,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:45,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:25:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:25:45,858 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 13 states. [2019-12-18 19:25:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:47,539 INFO L93 Difference]: Finished difference Result 205 states and 441 transitions. [2019-12-18 19:25:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:25:47,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 19:25:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:47,541 INFO L225 Difference]: With dead ends: 205 [2019-12-18 19:25:47,542 INFO L226 Difference]: Without dead ends: 195 [2019-12-18 19:25:47,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:25:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-18 19:25:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2019-12-18 19:25:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-18 19:25:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions. [2019-12-18 19:25:47,570 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 16 [2019-12-18 19:25:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:47,570 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions. [2019-12-18 19:25:47,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:25:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions. [2019-12-18 19:25:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:25:47,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:47,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:47,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1230311642, now seen corresponding path program 2 times [2019-12-18 19:25:47,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:47,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66712228] [2019-12-18 19:25:47,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:48,042 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 19:25:48,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66712228] [2019-12-18 19:25:48,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:48,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:25:48,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644337769] [2019-12-18 19:25:48,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:25:48,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:25:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:25:48,045 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand 12 states. [2019-12-18 19:25:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:50,046 INFO L93 Difference]: Finished difference Result 208 states and 440 transitions. [2019-12-18 19:25:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:25:50,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-18 19:25:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:50,050 INFO L225 Difference]: With dead ends: 208 [2019-12-18 19:25:50,051 INFO L226 Difference]: Without dead ends: 197 [2019-12-18 19:25:50,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:25:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-18 19:25:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 170. [2019-12-18 19:25:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-18 19:25:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-18 19:25:50,062 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-18 19:25:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:50,063 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-18 19:25:50,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:25:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-18 19:25:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:50,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:50,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:50,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash 145495381, now seen corresponding path program 1 times [2019-12-18 19:25:50,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:50,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962216825] [2019-12-18 19:25:50,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:50,623 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-12-18 19:25:51,015 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 19:25:51,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962216825] [2019-12-18 19:25:51,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:51,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:25:51,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645885533] [2019-12-18 19:25:51,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:25:51,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:25:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:25:51,018 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 16 states. [2019-12-18 19:25:51,809 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-18 19:25:52,094 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-12-18 19:25:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:53,093 INFO L93 Difference]: Finished difference Result 301 states and 660 transitions. [2019-12-18 19:25:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 19:25:53,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 19:25:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:53,097 INFO L225 Difference]: With dead ends: 301 [2019-12-18 19:25:53,098 INFO L226 Difference]: Without dead ends: 301 [2019-12-18 19:25:53,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:25:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-18 19:25:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2019-12-18 19:25:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 19:25:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 19:25:53,111 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 19:25:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:53,112 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 19:25:53,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:25:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 19:25:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:53,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:53,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:53,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:53,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 349911829, now seen corresponding path program 2 times [2019-12-18 19:25:53,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:53,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123873464] [2019-12-18 19:25:53,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:53,647 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2019-12-18 19:25:54,009 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 19:25:54,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123873464] [2019-12-18 19:25:54,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:54,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:25:54,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513632568] [2019-12-18 19:25:54,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:25:54,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:25:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:25:54,012 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-18 19:25:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:55,755 INFO L93 Difference]: Finished difference Result 307 states and 673 transitions. [2019-12-18 19:25:55,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:25:55,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 19:25:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:55,758 INFO L225 Difference]: With dead ends: 307 [2019-12-18 19:25:55,758 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 19:25:55,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:25:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 19:25:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2019-12-18 19:25:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 19:25:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 19:25:55,790 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 19:25:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:55,790 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 19:25:55,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:25:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 19:25:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:55,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:55,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:55,797 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 599415313, now seen corresponding path program 3 times [2019-12-18 19:25:55,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:55,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197544750] [2019-12-18 19:25:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:56,243 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-12-18 19:25:56,682 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 19:25:56,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197544750] [2019-12-18 19:25:56,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:56,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:25:56,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119426661] [2019-12-18 19:25:56,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:25:56,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:25:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:25:56,685 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-18 19:25:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:58,380 INFO L93 Difference]: Finished difference Result 304 states and 667 transitions. [2019-12-18 19:25:58,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:25:58,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 19:25:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:58,384 INFO L225 Difference]: With dead ends: 304 [2019-12-18 19:25:58,384 INFO L226 Difference]: Without dead ends: 304 [2019-12-18 19:25:58,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:25:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-18 19:25:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-12-18 19:25:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 19:25:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 19:25:58,394 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 19:25:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:58,394 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 19:25:58,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:25:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 19:25:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:58,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:58,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:58,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:25:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash -898885167, now seen corresponding path program 4 times [2019-12-18 19:25:58,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:58,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958460717] [2019-12-18 19:25:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:59,075 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 19:25:59,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958460717] [2019-12-18 19:25:59,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:59,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:25:59,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810995450] [2019-12-18 19:25:59,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:25:59,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:25:59,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:25:59,078 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-18 19:26:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:00,842 INFO L93 Difference]: Finished difference Result 419 states and 934 transitions. [2019-12-18 19:26:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:26:00,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 19:26:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:00,847 INFO L225 Difference]: With dead ends: 419 [2019-12-18 19:26:00,848 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 19:26:00,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:26:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 19:26:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 243. [2019-12-18 19:26:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 19:26:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 19:26:00,857 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 19:26:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 19:26:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 19:26:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:26:00,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:00,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:00,859 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 976531695, now seen corresponding path program 5 times [2019-12-18 19:26:00,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:00,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649002709] [2019-12-18 19:26:00,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:01,656 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 19:26:01,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649002709] [2019-12-18 19:26:01,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:01,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:01,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188191093] [2019-12-18 19:26:01,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:26:01,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:26:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:26:01,659 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 15 states. [2019-12-18 19:26:02,350 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-12-18 19:26:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:03,283 INFO L93 Difference]: Finished difference Result 322 states and 704 transitions. [2019-12-18 19:26:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:03,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 19:26:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:03,286 INFO L225 Difference]: With dead ends: 322 [2019-12-18 19:26:03,286 INFO L226 Difference]: Without dead ends: 322 [2019-12-18 19:26:03,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:26:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-18 19:26:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2019-12-18 19:26:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 19:26:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 19:26:03,295 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 19:26:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:03,295 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 19:26:03,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:26:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 19:26:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:26:03,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:03,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:03,296 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1354999957, now seen corresponding path program 6 times [2019-12-18 19:26:03,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:03,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259981363] [2019-12-18 19:26:03,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:03,790 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-12-18 19:26:04,141 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 19:26:04,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259981363] [2019-12-18 19:26:04,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:04,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:04,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857325347] [2019-12-18 19:26:04,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:04,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:04,144 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 16 states. [2019-12-18 19:26:05,150 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-18 19:26:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:06,003 INFO L93 Difference]: Finished difference Result 341 states and 754 transitions. [2019-12-18 19:26:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 19:26:06,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 19:26:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:06,007 INFO L225 Difference]: With dead ends: 341 [2019-12-18 19:26:06,007 INFO L226 Difference]: Without dead ends: 341 [2019-12-18 19:26:06,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:26:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-18 19:26:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 222. [2019-12-18 19:26:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 19:26:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-18 19:26:06,015 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-18 19:26:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:06,016 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-18 19:26:06,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-18 19:26:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:26:06,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:06,017 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:06,017 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 831318896, now seen corresponding path program 1 times [2019-12-18 19:26:06,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:06,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510793871] [2019-12-18 19:26:06,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:06,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510793871] [2019-12-18 19:26:06,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307226175] [2019-12-18 19:26:06,066 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 19:26:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:06,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-18 19:26:06,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:06,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:06,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 19:26:06,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427871284] [2019-12-18 19:26:06,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:26:06,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:26:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:26:06,161 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 5 states. [2019-12-18 19:26:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:06,177 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-18 19:26:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:26:06,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:26:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:06,179 INFO L225 Difference]: With dead ends: 326 [2019-12-18 19:26:06,179 INFO L226 Difference]: Without dead ends: 326 [2019-12-18 19:26:06,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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 19:26:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-18 19:26:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-18 19:26:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-18 19:26:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-18 19:26:06,188 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-18 19:26:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:06,188 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-18 19:26:06,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:26:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-18 19:26:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:06,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:06,190 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:06,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:06,405 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1273193156, now seen corresponding path program 7 times [2019-12-18 19:26:06,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:06,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263326578] [2019-12-18 19:26:06,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:06,980 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-12-18 19:26:07,286 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-12-18 19:26:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:07,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263326578] [2019-12-18 19:26:07,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523281946] [2019-12-18 19:26:07,750 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 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 19:26:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:07,832 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:26:07,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:07,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:07,903 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 19:26:07,903 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 19:26:07,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:07,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:07,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:07,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 19:26:08,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:08,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:08,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-18 19:26:08,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,281 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.9 percent of original size [2019-12-18 19:26:08,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,282 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:44 [2019-12-18 19:26:08,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:08,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:08,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2019-12-18 19:26:08,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 19:26:08,456 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2019-12-18 19:26:08,473 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:08,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,491 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:236, output treesize:38 [2019-12-18 19:26:08,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:08,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:08,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 134 [2019-12-18 19:26:08,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,694 INFO L614 ElimStorePlain]: treesize reduction 73, result has 44.3 percent of original size [2019-12-18 19:26:08,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:08,696 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 19:26:08,696 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:23 [2019-12-18 19:26:08,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:08,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 35 [2019-12-18 19:26:08,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:08,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:08,817 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 19:26:08,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-12-18 19:26:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:08,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:08,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2019-12-18 19:26:08,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156759694] [2019-12-18 19:26:08,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-18 19:26:08,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-18 19:26:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:26:08,826 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 28 states. [2019-12-18 19:26:09,869 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-12-18 19:26:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:12,234 INFO L93 Difference]: Finished difference Result 403 states and 886 transitions. [2019-12-18 19:26:12,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:26:12,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2019-12-18 19:26:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:12,239 INFO L225 Difference]: With dead ends: 403 [2019-12-18 19:26:12,239 INFO L226 Difference]: Without dead ends: 403 [2019-12-18 19:26:12,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 19:26:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-12-18 19:26:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 340. [2019-12-18 19:26:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 19:26:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 762 transitions. [2019-12-18 19:26:12,249 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 762 transitions. Word has length 23 [2019-12-18 19:26:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:12,250 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 762 transitions. [2019-12-18 19:26:12,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-18 19:26:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 762 transitions. [2019-12-18 19:26:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:12,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:12,251 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:12,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:12,455 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1480527740, now seen corresponding path program 8 times [2019-12-18 19:26:12,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:12,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249242748] [2019-12-18 19:26:12,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:12,997 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-12-18 19:26:13,294 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 42 [2019-12-18 19:26:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:13,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249242748] [2019-12-18 19:26:13,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741085224] [2019-12-18 19:26:13,715 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 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 19:26:13,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:26:13,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:26:13,783 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:26:13,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:13,804 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 38 treesize of output 34 [2019-12-18 19:26:13,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:13,829 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:26:13,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:13,841 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 37 treesize of output 24 [2019-12-18 19:26:13,842 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:13,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:13,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:13,853 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:26:14,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:14,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:14,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:26:14,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:14,484 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:26:14,485 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 19:26:14,485 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 19:26:14,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:14,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:14,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:26:14,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:14,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:26:14,718 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:14,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:14,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:26:14,730 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:14,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:14,748 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 19:26:14,748 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:26:14,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:14,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:26:15,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:15,061 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 19:26:15,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:15,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:15,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 19:26:15,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:15,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:26:15,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:15,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:15,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:15,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 19:26:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:15,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:15,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 19:26:15,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105418882] [2019-12-18 19:26:15,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 19:26:15,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 19:26:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:26:15,258 INFO L87 Difference]: Start difference. First operand 340 states and 762 transitions. Second operand 33 states. [2019-12-18 19:26:16,103 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-18 19:26:16,314 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-18 19:26:16,553 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-12-18 19:26:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:19,659 INFO L93 Difference]: Finished difference Result 444 states and 982 transitions. [2019-12-18 19:26:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:26:19,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-18 19:26:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:19,664 INFO L225 Difference]: With dead ends: 444 [2019-12-18 19:26:19,664 INFO L226 Difference]: Without dead ends: 444 [2019-12-18 19:26:19,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=437, Invalid=2985, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 19:26:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-18 19:26:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 340. [2019-12-18 19:26:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 19:26:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 762 transitions. [2019-12-18 19:26:19,674 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 762 transitions. Word has length 23 [2019-12-18 19:26:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:19,675 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 762 transitions. [2019-12-18 19:26:19,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 19:26:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 762 transitions. [2019-12-18 19:26:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:19,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:19,676 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:19,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:19,880 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1675104768, now seen corresponding path program 9 times [2019-12-18 19:26:19,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:19,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945672385] [2019-12-18 19:26:19,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:20,365 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2019-12-18 19:26:20,730 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-12-18 19:26:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:21,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945672385] [2019-12-18 19:26:21,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081690891] [2019-12-18 19:26:21,127 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 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 19:26:21,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:26:21,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:26:21,237 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:26:21,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:21,274 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 38 treesize of output 34 [2019-12-18 19:26:21,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:21,296 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:26:21,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:21,305 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 37 treesize of output 24 [2019-12-18 19:26:21,305 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:21,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:21,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:21,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:26:21,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:21,703 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:21,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:21,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:26:21,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:21,789 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:26:21,790 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 19:26:21,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 19:26:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:22,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:22,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:26:22,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:22,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:26:22,082 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:22,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:26:22,094 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:22,113 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 19:26:22,113 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:26:22,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:22,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:26:22,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,443 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 19:26:22,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:22,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:22,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 19:26:22,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:22,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:26:22,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:22,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:22,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 19:26:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:22,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:22,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 19:26:22,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703253190] [2019-12-18 19:26:22,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 19:26:22,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 19:26:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:26:22,604 INFO L87 Difference]: Start difference. First operand 340 states and 762 transitions. Second operand 33 states. [2019-12-18 19:26:23,697 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 56 [2019-12-18 19:26:24,033 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-12-18 19:26:24,204 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 19:26:25,926 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 19:26:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:27,298 INFO L93 Difference]: Finished difference Result 533 states and 1187 transitions. [2019-12-18 19:26:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 19:26:27,298 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-18 19:26:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:27,302 INFO L225 Difference]: With dead ends: 533 [2019-12-18 19:26:27,302 INFO L226 Difference]: Without dead ends: 533 [2019-12-18 19:26:27,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=492, Invalid=3290, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 19:26:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-18 19:26:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 340. [2019-12-18 19:26:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 19:26:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 762 transitions. [2019-12-18 19:26:27,313 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 762 transitions. Word has length 23 [2019-12-18 19:26:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:27,313 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 762 transitions. [2019-12-18 19:26:27,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 19:26:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 762 transitions. [2019-12-18 19:26:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:27,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:27,315 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:27,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:27,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1319631296, now seen corresponding path program 10 times [2019-12-18 19:26:27,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:27,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736906773] [2019-12-18 19:26:27,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:28,207 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 40 [2019-12-18 19:26:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:28,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736906773] [2019-12-18 19:26:28,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804155076] [2019-12-18 19:26:28,621 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 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 19:26:28,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:26:28,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:26:28,684 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-18 19:26:28,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:28,709 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 23 treesize of output 21 [2019-12-18 19:26:28,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:26:28,733 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:26:28,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:28,741 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 37 treesize of output 24 [2019-12-18 19:26:28,741 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:28,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:28,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:28,751 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:26:29,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:29,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:29,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:26:29,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:29,091 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:26:29,092 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 19:26:29,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 19:26:29,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:29,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:29,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:29,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 19:26:29,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:29,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:29,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 19:26:29,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:29,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:29,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 19:26:29,332 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:29,403 INFO L614 ElimStorePlain]: treesize reduction 135, result has 28.2 percent of original size [2019-12-18 19:26:29,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:29,405 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:245, output treesize:53 [2019-12-18 19:26:29,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:29,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 107 [2019-12-18 19:26:29,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:29,828 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-18 19:26:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:29,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:29,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2019-12-18 19:26:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:30,473 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-18 19:26:30,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:30,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:30,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2019-12-18 19:26:30,593 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:30,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:30,607 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 19:26:30,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:7 [2019-12-18 19:26:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:30,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:30,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-12-18 19:26:30,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599142714] [2019-12-18 19:26:30,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-18 19:26:30,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-18 19:26:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:26:30,642 INFO L87 Difference]: Start difference. First operand 340 states and 762 transitions. Second operand 34 states. [2019-12-18 19:26:31,320 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-12-18 19:26:31,676 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-18 19:26:31,931 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-18 19:26:32,132 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-12-18 19:26:32,544 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-12-18 19:26:33,095 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-18 19:26:33,332 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-12-18 19:26:33,510 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-12-18 19:26:33,930 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2019-12-18 19:26:34,159 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 56 [2019-12-18 19:26:34,330 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-12-18 19:26:34,664 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-12-18 19:26:34,900 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-12-18 19:26:35,167 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2019-12-18 19:26:35,377 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-12-18 19:26:35,837 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-12-18 19:26:36,348 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2019-12-18 19:26:37,042 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-12-18 19:26:37,428 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 67 [2019-12-18 19:26:37,792 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-18 19:26:38,105 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 58 [2019-12-18 19:26:38,305 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-12-18 19:26:38,477 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-18 19:26:38,788 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-18 19:26:39,047 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 52 [2019-12-18 19:26:39,596 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-12-18 19:26:39,880 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 61 [2019-12-18 19:26:40,125 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 73 [2019-12-18 19:26:40,340 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 58 [2019-12-18 19:26:40,525 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-12-18 19:26:40,857 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-12-18 19:26:41,154 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 55 [2019-12-18 19:26:41,417 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2019-12-18 19:26:41,696 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-12-18 19:26:42,240 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 63 [2019-12-18 19:26:42,516 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-12-18 19:26:42,718 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-18 19:26:43,333 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 57 [2019-12-18 19:26:43,610 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-12-18 19:26:44,214 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2019-12-18 19:26:44,423 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-12-18 19:26:44,904 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 79 [2019-12-18 19:26:45,393 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2019-12-18 19:26:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:46,133 INFO L93 Difference]: Finished difference Result 593 states and 1310 transitions. [2019-12-18 19:26:46,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-18 19:26:46,133 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 23 [2019-12-18 19:26:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:46,138 INFO L225 Difference]: With dead ends: 593 [2019-12-18 19:26:46,138 INFO L226 Difference]: Without dead ends: 593 [2019-12-18 19:26:46,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1139, Invalid=7603, Unknown=0, NotChecked=0, Total=8742 [2019-12-18 19:26:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-18 19:26:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 417. [2019-12-18 19:26:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-18 19:26:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 931 transitions. [2019-12-18 19:26:46,152 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 931 transitions. Word has length 23 [2019-12-18 19:26:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:46,154 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 931 transitions. [2019-12-18 19:26:46,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-18 19:26:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 931 transitions. [2019-12-18 19:26:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:46,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:46,155 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:46,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:46,359 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 378903552, now seen corresponding path program 11 times [2019-12-18 19:26:46,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:46,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630645282] [2019-12-18 19:26:46,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:46,818 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-12-18 19:26:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:47,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630645282] [2019-12-18 19:26:47,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726558860] [2019-12-18 19:26:47,446 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 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 19:26:47,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:26:47,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:26:47,513 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:26:47,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:47,530 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 38 treesize of output 34 [2019-12-18 19:26:47,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:47,549 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:26:47,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:47,556 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 37 treesize of output 24 [2019-12-18 19:26:47,556 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:47,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:47,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:47,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:26:48,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:48,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:48,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:26:48,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:48,195 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:26:48,196 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 19:26:48,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 19:26:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:48,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:48,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:26:48,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:48,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:48,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:26:48,530 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:48,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:48,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:26:48,544 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:48,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:48,565 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 19:26:48,565 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-18 19:26:48,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:48,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:26:48,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:48,949 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 19:26:48,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:48,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:48,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 19:26:49,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:49,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:26:49,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:49,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:49,074 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:49,074 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 19:26:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:49,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:49,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 33 [2019-12-18 19:26:49,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692714937] [2019-12-18 19:26:49,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 19:26:49,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 19:26:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 19:26:49,147 INFO L87 Difference]: Start difference. First operand 417 states and 931 transitions. Second operand 35 states. [2019-12-18 19:26:49,986 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-12-18 19:26:50,354 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2019-12-18 19:26:50,727 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-18 19:26:52,324 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-12-18 19:26:52,824 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-18 19:26:53,296 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-12-18 19:26:53,962 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 19:26:54,314 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-18 19:26:54,671 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-18 19:26:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:56,120 INFO L93 Difference]: Finished difference Result 570 states and 1245 transitions. [2019-12-18 19:26:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 19:26:56,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 19:26:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:56,124 INFO L225 Difference]: With dead ends: 570 [2019-12-18 19:26:56,124 INFO L226 Difference]: Without dead ends: 570 [2019-12-18 19:26:56,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=686, Invalid=4864, Unknown=0, NotChecked=0, Total=5550 [2019-12-18 19:26:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-18 19:26:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 414. [2019-12-18 19:26:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 19:26:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 919 transitions. [2019-12-18 19:26:56,135 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 919 transitions. Word has length 23 [2019-12-18 19:26:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:56,136 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 919 transitions. [2019-12-18 19:26:56,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 19:26:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 919 transitions. [2019-12-18 19:26:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:26:56,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:56,137 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:56,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:26:56,341 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:26:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash 258492924, now seen corresponding path program 12 times [2019-12-18 19:26:56,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:56,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608496583] [2019-12-18 19:26:56,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:56,825 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 37 [2019-12-18 19:26:57,089 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2019-12-18 19:26:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:57,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608496583] [2019-12-18 19:26:57,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2452898] [2019-12-18 19:26:57,751 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 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 19:26:57,816 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 19:26:57,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:26:57,818 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:26:57,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:26:57,828 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 32 treesize of output 30 [2019-12-18 19:26:57,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:57,848 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-18 19:26:57,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:57,855 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 37 treesize of output 24 [2019-12-18 19:26:57,855 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:57,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:57,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:57,867 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:26:58,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:58,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:58,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:26:58,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:58,330 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:26:58,330 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 19:26:58,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 19:26:58,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:58,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:58,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:58,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:26:58,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:58,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:26:58,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:26:58,532 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:58,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:26:58,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:26:58,541 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:58,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:58,558 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 19:26:58,558 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-18 19:26:58,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:58,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:26:58,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:58,835 INFO L614 ElimStorePlain]: treesize reduction 64, result has 47.5 percent of original size [2019-12-18 19:26:58,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:26:58,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:26:58,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:29 [2019-12-18 19:26:59,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:59,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:26:59,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:26:59,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:26:59,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:26:59,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 19:26:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:59,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:26:59,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 36 [2019-12-18 19:26:59,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673088321] [2019-12-18 19:26:59,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 19:26:59,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 19:26:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 19:26:59,129 INFO L87 Difference]: Start difference. First operand 414 states and 919 transitions. Second operand 38 states. [2019-12-18 19:26:59,789 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-18 19:27:00,356 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-18 19:27:00,629 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-18 19:27:01,014 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-12-18 19:27:01,232 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-18 19:27:01,645 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-18 19:27:01,827 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-18 19:27:02,189 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-12-18 19:27:02,409 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 19:27:02,594 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-18 19:27:02,932 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-12-18 19:27:03,218 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-12-18 19:27:03,606 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-12-18 19:27:03,854 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-12-18 19:27:04,817 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-12-18 19:27:05,013 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2019-12-18 19:27:05,528 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-12-18 19:27:05,882 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-18 19:27:06,095 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 65 [2019-12-18 19:27:06,257 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-12-18 19:27:06,820 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 68 [2019-12-18 19:27:07,288 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2019-12-18 19:27:07,489 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-12-18 19:27:07,757 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-12-18 19:27:07,963 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2019-12-18 19:27:08,369 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-12-18 19:27:08,572 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2019-12-18 19:27:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:09,457 INFO L93 Difference]: Finished difference Result 576 states and 1243 transitions. [2019-12-18 19:27:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 19:27:09,458 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 23 [2019-12-18 19:27:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:09,461 INFO L225 Difference]: With dead ends: 576 [2019-12-18 19:27:09,461 INFO L226 Difference]: Without dead ends: 576 [2019-12-18 19:27:09,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1202, Invalid=6988, Unknown=0, NotChecked=0, Total=8190 [2019-12-18 19:27:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-18 19:27:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 412. [2019-12-18 19:27:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-18 19:27:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 901 transitions. [2019-12-18 19:27:09,472 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 901 transitions. Word has length 23 [2019-12-18 19:27:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:09,472 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 901 transitions. [2019-12-18 19:27:09,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 19:27:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 901 transitions. [2019-12-18 19:27:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:27:09,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:09,474 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:09,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:09,677 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1115213342, now seen corresponding path program 13 times [2019-12-18 19:27:09,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:09,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981760820] [2019-12-18 19:27:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:10,153 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-12-18 19:27:10,445 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 42 [2019-12-18 19:27:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:10,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981760820] [2019-12-18 19:27:10,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098723062] [2019-12-18 19:27:10,822 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 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 19:27:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:10,893 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 19:27:10,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:10,904 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 38 treesize of output 34 [2019-12-18 19:27:10,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:10,925 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:27:10,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:10,931 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 37 treesize of output 24 [2019-12-18 19:27:10,932 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:10,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:10,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:10,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:27:11,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:11,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:11,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:27:11,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:11,441 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:27:11,442 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 19:27:11,442 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 19:27:11,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:11,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:11,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:27:11,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:11,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:27:11,650 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:11,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:11,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:27:11,659 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:11,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:11,677 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 19:27:11,677 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:27:11,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:11,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:27:11,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:12,024 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 19:27:12,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:12,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:12,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 19:27:12,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:12,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:27:12,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:12,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:12,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:27:12,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 19:27:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:12,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:12,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 19:27:12,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256939748] [2019-12-18 19:27:12,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 19:27:12,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 19:27:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:27:12,194 INFO L87 Difference]: Start difference. First operand 412 states and 901 transitions. Second operand 33 states. [2019-12-18 19:27:12,810 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-18 19:27:13,081 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-18 19:27:13,312 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-18 19:27:13,518 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-12-18 19:27:14,922 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 19:27:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:16,360 INFO L93 Difference]: Finished difference Result 515 states and 1118 transitions. [2019-12-18 19:27:16,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:27:16,360 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-18 19:27:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:16,364 INFO L225 Difference]: With dead ends: 515 [2019-12-18 19:27:16,364 INFO L226 Difference]: Without dead ends: 515 [2019-12-18 19:27:16,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=457, Invalid=3083, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 19:27:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-18 19:27:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 412. [2019-12-18 19:27:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-18 19:27:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 901 transitions. [2019-12-18 19:27:16,373 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 901 transitions. Word has length 23 [2019-12-18 19:27:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 901 transitions. [2019-12-18 19:27:16,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 19:27:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 901 transitions. [2019-12-18 19:27:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:27:16,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:16,374 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:16,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:16,578 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1827682534, now seen corresponding path program 14 times [2019-12-18 19:27:16,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:16,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337221564] [2019-12-18 19:27:16,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:17,060 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-12-18 19:27:17,365 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-12-18 19:27:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:17,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337221564] [2019-12-18 19:27:17,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575281666] [2019-12-18 19:27:17,812 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 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 19:27:17,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:27:17,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:27:17,891 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-18 19:27:17,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:17,918 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 38 treesize of output 34 [2019-12-18 19:27:17,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:17,937 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:27:17,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:17,942 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 37 treesize of output 24 [2019-12-18 19:27:17,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:17,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:17,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:17,954 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 19:27:18,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:18,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:18,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:27:18,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:18,455 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:27:18,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:18,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 19:27:18,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:18,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:18,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:27:18,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:18,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:27:18,658 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:18,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:18,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:27:18,667 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:18,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:18,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:18,686 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 19:27:18,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:18,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 19:27:18,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:18,973 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 19:27:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:18,974 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 19:27:18,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 19:27:19,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:19,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 19:27:19,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:19,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:19,094 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 19:27:19,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 19:27:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-18 19:27:19,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59546020] [2019-12-18 19:27:19,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 19:27:19,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:19,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 19:27:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 19:27:19,118 INFO L87 Difference]: Start difference. First operand 412 states and 901 transitions. Second operand 35 states. [2019-12-18 19:27:19,722 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-12-18 19:27:20,310 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-18 19:27:20,522 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-12-18 19:27:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:23,204 INFO L93 Difference]: Finished difference Result 482 states and 1049 transitions. [2019-12-18 19:27:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:27:23,205 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 19:27:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:23,208 INFO L225 Difference]: With dead ends: 482 [2019-12-18 19:27:23,208 INFO L226 Difference]: Without dead ends: 482 [2019-12-18 19:27:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=503, Invalid=3157, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 19:27:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-18 19:27:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 376. [2019-12-18 19:27:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-18 19:27:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 826 transitions. [2019-12-18 19:27:23,217 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 826 transitions. Word has length 23 [2019-12-18 19:27:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:23,217 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 826 transitions. [2019-12-18 19:27:23,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 19:27:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 826 transitions. [2019-12-18 19:27:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:23,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:23,218 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:23,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:23,422 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2090449835, now seen corresponding path program 15 times [2019-12-18 19:27:23,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:23,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559797784] [2019-12-18 19:27:23,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:24,023 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2019-12-18 19:27:24,359 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 40 [2019-12-18 19:27:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:24,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559797784] [2019-12-18 19:27:24,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830675315] [2019-12-18 19:27:24,922 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 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 19:27:25,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:27:25,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:27:25,003 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-18 19:27:25,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:25,026 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 23 treesize of output 21 [2019-12-18 19:27:25,026 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:27:25,045 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:27:25,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,052 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 37 treesize of output 24 [2019-12-18 19:27:25,052 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:25,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:25,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:25,063 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:27:25,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,538 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:25,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:25,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:27:25,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:25,622 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:27:25,622 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 19:27:25,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 19:27:25,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:25,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:25,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:27:25,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:25,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:27:25,836 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:25,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:25,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:27:25,854 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:25,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:25,873 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 19:27:25,874 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:27:26,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:26,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:26,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:26,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:26,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:27:26,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:26,188 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 19:27:26,189 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 19:27:26,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 19:27:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:26,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:27:26,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:26,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 19:27:26,362 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:26,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:27:26,383 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:26,440 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 19:27:26,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:26,441 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 19:27:26,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:26,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 19:27:26,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:26,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:26,603 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 19:27:26,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 19:27:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:26,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:26,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 19:27:26,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141457744] [2019-12-18 19:27:26,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 19:27:26,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 19:27:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:27:26,682 INFO L87 Difference]: Start difference. First operand 376 states and 826 transitions. Second operand 39 states. [2019-12-18 19:27:27,244 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-12-18 19:27:27,540 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 19:27:27,752 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 19:27:27,952 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 19:27:29,070 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-18 19:27:29,531 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-18 19:27:30,241 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 19:27:30,530 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-18 19:27:31,020 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-18 19:27:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:31,925 INFO L93 Difference]: Finished difference Result 544 states and 1188 transitions. [2019-12-18 19:27:31,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:27:31,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-18 19:27:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:31,929 INFO L225 Difference]: With dead ends: 544 [2019-12-18 19:27:31,929 INFO L226 Difference]: Without dead ends: 544 [2019-12-18 19:27:31,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=538, Invalid=3622, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 19:27:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-18 19:27:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 418. [2019-12-18 19:27:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-18 19:27:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 917 transitions. [2019-12-18 19:27:31,938 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 917 transitions. Word has length 25 [2019-12-18 19:27:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:31,938 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 917 transitions. [2019-12-18 19:27:31,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 19:27:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 917 transitions. [2019-12-18 19:27:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:31,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:31,940 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:32,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:32,144 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1978593398, now seen corresponding path program 1 times [2019-12-18 19:27:32,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:32,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792459121] [2019-12-18 19:27:32,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:32,621 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-12-18 19:27:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:32,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792459121] [2019-12-18 19:27:32,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601805710] [2019-12-18 19:27:32,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:33,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-18 19:27:33,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:33,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:33,044 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 19:27:33,044 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 19:27:33,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:33,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:33,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 19:27:33,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:33,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:33,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-18 19:27:33,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,245 INFO L614 ElimStorePlain]: treesize reduction 46, result has 43.2 percent of original size [2019-12-18 19:27:33,245 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 19:27:33,245 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2019-12-18 19:27:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:33,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:33,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:33,315 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 45 treesize of output 32 [2019-12-18 19:27:33,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:33,325 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 57 treesize of output 40 [2019-12-18 19:27:33,325 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:33,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2019-12-18 19:27:33,329 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:33,333 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:27:33,334 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:156, output treesize:18 [2019-12-18 19:27:33,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:33,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:33,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:33,411 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 51 treesize of output 34 [2019-12-18 19:27:33,412 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:33,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:33,423 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 52 treesize of output 35 [2019-12-18 19:27:33,424 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:33,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2019-12-18 19:27:33,429 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:33,464 INFO L614 ElimStorePlain]: treesize reduction 85, result has 24.8 percent of original size [2019-12-18 19:27:33,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:33,464 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:177, output treesize:28 [2019-12-18 19:27:33,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:33,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:33,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2019-12-18 19:27:33,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51927859] [2019-12-18 19:27:33,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 19:27:33,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 19:27:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:27:33,581 INFO L87 Difference]: Start difference. First operand 418 states and 917 transitions. Second operand 26 states. [2019-12-18 19:27:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:35,502 INFO L93 Difference]: Finished difference Result 482 states and 1042 transitions. [2019-12-18 19:27:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:35,502 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-12-18 19:27:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:35,505 INFO L225 Difference]: With dead ends: 482 [2019-12-18 19:27:35,505 INFO L226 Difference]: Without dead ends: 465 [2019-12-18 19:27:35,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:27:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-12-18 19:27:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 453. [2019-12-18 19:27:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-12-18 19:27:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 990 transitions. [2019-12-18 19:27:35,515 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 990 transitions. Word has length 25 [2019-12-18 19:27:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:35,515 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 990 transitions. [2019-12-18 19:27:35,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 19:27:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 990 transitions. [2019-12-18 19:27:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:35,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:35,516 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:35,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:35,720 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1352666678, now seen corresponding path program 2 times [2019-12-18 19:27:35,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:35,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332489925] [2019-12-18 19:27:35,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:36,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332489925] [2019-12-18 19:27:36,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638649677] [2019-12-18 19:27:36,741 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 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 19:27:36,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:27:36,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:27:36,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-18 19:27:36,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:36,846 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 23 treesize of output 21 [2019-12-18 19:27:36,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:27:36,874 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:27:36,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:36,878 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 37 treesize of output 24 [2019-12-18 19:27:36,878 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:36,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:36,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:36,889 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:27:37,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:37,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:37,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:27:37,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,222 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 19:27:37,223 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 19:27:37,223 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 19:27:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:37,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:37,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 19:27:37,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:37,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 19:27:37,362 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 19:27:37,372 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:37,383 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 19:27:37,383 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 19:27:37,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:37,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:37,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:37,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:37,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 19:27:37,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,596 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:37,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:37,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 19:27:37,602 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 19:27:37,606 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:37,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:37,615 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 19:27:37,616 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 19:27:37,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:37,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:37,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-12-18 19:27:37,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566096734] [2019-12-18 19:27:37,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 19:27:37,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 19:27:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:27:37,750 INFO L87 Difference]: Start difference. First operand 453 states and 990 transitions. Second operand 32 states. [2019-12-18 19:27:38,950 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 19:27:39,143 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-12-18 19:27:39,363 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-12-18 19:27:39,750 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2019-12-18 19:27:39,925 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-12-18 19:27:40,281 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2019-12-18 19:27:40,532 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-12-18 19:27:40,882 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-12-18 19:27:41,129 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-12-18 19:27:41,300 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-12-18 19:27:41,731 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 58 [2019-12-18 19:27:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:43,270 INFO L93 Difference]: Finished difference Result 566 states and 1218 transitions. [2019-12-18 19:27:43,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:27:43,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 19:27:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:43,274 INFO L225 Difference]: With dead ends: 566 [2019-12-18 19:27:43,274 INFO L226 Difference]: Without dead ends: 549 [2019-12-18 19:27:43,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=518, Invalid=2904, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 19:27:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-12-18 19:27:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 514. [2019-12-18 19:27:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-18 19:27:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1117 transitions. [2019-12-18 19:27:43,283 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1117 transitions. Word has length 25 [2019-12-18 19:27:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:43,284 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1117 transitions. [2019-12-18 19:27:43,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 19:27:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1117 transitions. [2019-12-18 19:27:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:43,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:43,285 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:43,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:43,489 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 638994318, now seen corresponding path program 3 times [2019-12-18 19:27:43,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:43,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751574292] [2019-12-18 19:27:43,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:44,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751574292] [2019-12-18 19:27:44,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413513204] [2019-12-18 19:27:44,122 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 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 19:27:44,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:27:44,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:27:44,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-18 19:27:44,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:44,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,212 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 19:27:44,212 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 19:27:44,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:44,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:44,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 19:27:44,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:44,299 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 2 case distinctions, treesize of input 39 treesize of output 76 [2019-12-18 19:27:44,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,334 INFO L614 ElimStorePlain]: treesize reduction 46, result has 43.2 percent of original size [2019-12-18 19:27:44,334 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 19:27:44,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:26 [2019-12-18 19:27:44,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:44,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:44,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,386 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 57 treesize of output 40 [2019-12-18 19:27:44,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,399 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 44 treesize of output 31 [2019-12-18 19:27:44,400 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2019-12-18 19:27:44,404 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:44,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:27:44,410 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:156, output treesize:18 [2019-12-18 19:27:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:44,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,482 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 51 treesize of output 34 [2019-12-18 19:27:44,483 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:44,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:44,492 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 64 treesize of output 43 [2019-12-18 19:27:44,493 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:44,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2019-12-18 19:27:44,497 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:44,525 INFO L614 ElimStorePlain]: treesize reduction 85, result has 24.8 percent of original size [2019-12-18 19:27:44,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:44,526 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:177, output treesize:28 [2019-12-18 19:27:44,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:44,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:44,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2019-12-18 19:27:44,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707619722] [2019-12-18 19:27:44,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 19:27:44,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:44,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 19:27:44,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:27:44,665 INFO L87 Difference]: Start difference. First operand 514 states and 1117 transitions. Second operand 22 states. [2019-12-18 19:27:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:47,297 INFO L93 Difference]: Finished difference Result 593 states and 1272 transitions. [2019-12-18 19:27:47,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:27:47,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-18 19:27:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:47,301 INFO L225 Difference]: With dead ends: 593 [2019-12-18 19:27:47,301 INFO L226 Difference]: Without dead ends: 576 [2019-12-18 19:27:47,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 19:27:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-18 19:27:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 514. [2019-12-18 19:27:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-18 19:27:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1117 transitions. [2019-12-18 19:27:47,309 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1117 transitions. Word has length 25 [2019-12-18 19:27:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:47,310 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1117 transitions. [2019-12-18 19:27:47,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 19:27:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1117 transitions. [2019-12-18 19:27:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:47,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:47,311 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:47,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:27:47,514 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:27:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 617486703, now seen corresponding path program 16 times [2019-12-18 19:27:47,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:47,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027533367] [2019-12-18 19:27:47,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:47,891 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-12-18 19:27:48,053 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-12-18 19:27:48,268 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2019-12-18 19:27:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:48,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027533367] [2019-12-18 19:27:48,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40714024] [2019-12-18 19:27:48,998 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 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 19:27:49,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:27:49,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:27:49,064 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-18 19:27:49,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:27:49,074 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 23 treesize of output 21 [2019-12-18 19:27:49,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:27:49,098 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-12-18 19:27:49,113 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-18 19:27:49,114 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 19:27:49,114 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:49,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:49,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:49,124 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-18 19:27:49,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:49,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:49,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:27:49,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:49,575 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-18 19:27:49,576 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 19:27:49,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2019-12-18 19:27:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:49,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:49,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:27:49,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:49,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:27:49,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:27:49,789 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:49,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:49,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:27:49,798 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:49,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:49,816 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 19:27:49,816 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 19:27:50,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:27:50,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:27:50,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,235 INFO L614 ElimStorePlain]: treesize reduction 72, result has 43.3 percent of original size [2019-12-18 19:27:50,235 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 19:27:50,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:46 [2019-12-18 19:27:50,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:50,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:27:50,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 19:27:50,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 19:27:50,489 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:27:50,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 19:27:50,502 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,547 INFO L614 ElimStorePlain]: treesize reduction 123, result has 27.6 percent of original size [2019-12-18 19:27:50,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:27:50,548 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:227, output treesize:47 [2019-12-18 19:27:50,886 INFO L343 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2019-12-18 19:27:50,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 56 [2019-12-18 19:27:50,887 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,916 INFO L614 ElimStorePlain]: treesize reduction 26, result has 35.0 percent of original size [2019-12-18 19:27:50,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:27:50,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:7 [2019-12-18 19:27:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:51,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:27:51,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 37 [2019-12-18 19:27:51,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433689549] [2019-12-18 19:27:51,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 19:27:51,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 19:27:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1384, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:27:51,098 INFO L87 Difference]: Start difference. First operand 514 states and 1117 transitions. Second operand 39 states. [2019-12-18 19:27:52,674 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-12-18 19:27:53,077 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-12-18 19:27:53,500 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-12-18 19:27:54,301 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-18 19:27:55,161 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2019-12-18 19:27:55,368 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2019-12-18 19:27:55,623 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-12-18 19:27:55,805 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 50 [2019-12-18 19:27:56,258 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2019-12-18 19:27:56,582 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2019-12-18 19:27:57,022 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-12-18 19:27:57,241 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-18 19:27:57,557 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2019-12-18 19:27:57,761 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-12-18 19:27:57,972 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-12-18 19:27:58,459 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2019-12-18 19:27:58,934 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-12-18 19:27:59,511 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-12-18 19:27:59,780 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-12-18 19:28:00,116 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-12-18 19:28:00,344 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-18 19:28:00,786 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2019-12-18 19:28:01,226 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 74 [2019-12-18 19:28:01,685 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-12-18 19:28:02,006 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-12-18 19:28:02,256 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2019-12-18 19:28:02,958 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-12-18 19:28:03,671 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-18 19:28:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:04,614 INFO L93 Difference]: Finished difference Result 861 states and 1870 transitions. [2019-12-18 19:28:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 19:28:04,614 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-18 19:28:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:04,619 INFO L225 Difference]: With dead ends: 861 [2019-12-18 19:28:04,619 INFO L226 Difference]: Without dead ends: 861 [2019-12-18 19:28:04,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=913, Invalid=6569, Unknown=0, NotChecked=0, Total=7482 [2019-12-18 19:28:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-18 19:28:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 514. [2019-12-18 19:28:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-18 19:28:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1117 transitions. [2019-12-18 19:28:04,631 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1117 transitions. Word has length 25 [2019-12-18 19:28:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:04,632 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1117 transitions. [2019-12-18 19:28:04,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 19:28:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1117 transitions. [2019-12-18 19:28:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:28:04,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:04,633 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:04,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:04,837 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -631310293, now seen corresponding path program 17 times [2019-12-18 19:28:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:04,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382134142] [2019-12-18 19:28:04,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:05,325 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-18 19:28:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:06,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382134142] [2019-12-18 19:28:06,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606387689] [2019-12-18 19:28:06,103 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 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 19:28:06,172 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:28:06,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:28:06,174 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-18 19:28:06,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:06,186 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 23 treesize of output 21 [2019-12-18 19:28:06,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:28:06,215 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:28:06,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,220 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 37 treesize of output 24 [2019-12-18 19:28:06,221 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:06,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:06,232 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:06,232 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:28:06,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:06,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:06,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:06,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:06,701 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:28:06,701 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 19:28:06,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 19:28:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:06,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:06,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:28:06,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:06,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:06,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:28:06,896 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:06,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:06,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:28:06,902 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:06,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:06,920 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 19:28:06,920 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-18 19:28:07,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:07,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:07,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:07,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:07,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:28:07,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:07,201 INFO L614 ElimStorePlain]: treesize reduction 72, result has 43.3 percent of original size [2019-12-18 19:28:07,202 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 19:28:07,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:46 [2019-12-18 19:28:07,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:07,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:07,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:07,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 19:28:07,334 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:07,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:07,342 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:07,389 INFO L614 ElimStorePlain]: treesize reduction 115, result has 27.2 percent of original size [2019-12-18 19:28:07,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:07,390 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:43 [2019-12-18 19:28:07,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:07,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 19:28:07,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:07,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:07,642 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 19:28:07,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 19:28:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:07,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:07,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-18 19:28:07,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086977658] [2019-12-18 19:28:07,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 19:28:07,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:07,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 19:28:07,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 19:28:07,724 INFO L87 Difference]: Start difference. First operand 514 states and 1117 transitions. Second operand 37 states. [2019-12-18 19:28:08,787 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-12-18 19:28:09,139 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-12-18 19:28:10,332 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-18 19:28:10,764 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-12-18 19:28:11,181 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-12-18 19:28:11,863 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-18 19:28:12,370 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-12-18 19:28:12,562 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-18 19:28:12,937 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-12-18 19:28:13,320 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-12-18 19:28:13,513 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-18 19:28:13,759 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-18 19:28:13,962 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2019-12-18 19:28:14,250 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-18 19:28:14,464 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-12-18 19:28:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:15,003 INFO L93 Difference]: Finished difference Result 769 states and 1681 transitions. [2019-12-18 19:28:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 19:28:15,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-18 19:28:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:15,008 INFO L225 Difference]: With dead ends: 769 [2019-12-18 19:28:15,008 INFO L226 Difference]: Without dead ends: 769 [2019-12-18 19:28:15,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=634, Invalid=4058, Unknown=0, NotChecked=0, Total=4692 [2019-12-18 19:28:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-18 19:28:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 520. [2019-12-18 19:28:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-12-18 19:28:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1130 transitions. [2019-12-18 19:28:15,018 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1130 transitions. Word has length 25 [2019-12-18 19:28:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:15,019 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 1130 transitions. [2019-12-18 19:28:15,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 19:28:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1130 transitions. [2019-12-18 19:28:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:28:15,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:15,020 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:15,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:15,224 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 927642954, now seen corresponding path program 4 times [2019-12-18 19:28:15,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:15,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2500202] [2019-12-18 19:28:15,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:15,895 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 31 [2019-12-18 19:28:16,077 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 31 [2019-12-18 19:28:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:16,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2500202] [2019-12-18 19:28:16,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817737756] [2019-12-18 19:28:16,505 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 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 19:28:16,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:28:16,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:28:16,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-18 19:28:16,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:16,580 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 38 treesize of output 34 [2019-12-18 19:28:16,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:16,598 INFO L614 ElimStorePlain]: treesize reduction 13, result has 76.4 percent of original size [2019-12-18 19:28:16,612 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-18 19:28:16,612 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 19:28:16,612 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:16,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:16,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:16,621 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-18 19:28:16,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:16,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:16,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:16,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:16,899 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.3 percent of original size [2019-12-18 19:28:16,899 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 19:28:16,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:34 [2019-12-18 19:28:17,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:17,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:17,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:28:17,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:28:17,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,067 INFO L343 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2019-12-18 19:28:17,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:28:17,068 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:17,076 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 19:28:17,076 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:28 [2019-12-18 19:28:17,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:17,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:17,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-18 19:28:17,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-18 19:28:17,260 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:17,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-18 19:28:17,265 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:17,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:17,273 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 19:28:17,273 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:28 [2019-12-18 19:28:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:17,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:17,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-12-18 19:28:17,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404093054] [2019-12-18 19:28:17,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 19:28:17,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 19:28:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:28:17,431 INFO L87 Difference]: Start difference. First operand 520 states and 1130 transitions. Second operand 31 states. [2019-12-18 19:28:18,669 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-12-18 19:28:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:20,289 INFO L93 Difference]: Finished difference Result 562 states and 1211 transitions. [2019-12-18 19:28:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:20,290 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2019-12-18 19:28:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:20,293 INFO L225 Difference]: With dead ends: 562 [2019-12-18 19:28:20,293 INFO L226 Difference]: Without dead ends: 545 [2019-12-18 19:28:20,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 19:28:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-12-18 19:28:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 492. [2019-12-18 19:28:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-12-18 19:28:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1074 transitions. [2019-12-18 19:28:20,311 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1074 transitions. Word has length 25 [2019-12-18 19:28:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:20,311 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 1074 transitions. [2019-12-18 19:28:20,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 19:28:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1074 transitions. [2019-12-18 19:28:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:28:20,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:20,312 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:20,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:20,516 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -709771567, now seen corresponding path program 18 times [2019-12-18 19:28:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:20,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539936485] [2019-12-18 19:28:20,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:21,029 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-12-18 19:28:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:22,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539936485] [2019-12-18 19:28:22,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626320958] [2019-12-18 19:28:22,003 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 [2019-12-18 19:28:22,075 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 19:28:22,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:28:22,077 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-18 19:28:22,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:22,091 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 38 treesize of output 34 [2019-12-18 19:28:22,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,109 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:28:22,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,114 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 37 treesize of output 24 [2019-12-18 19:28:22,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:22,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:22,126 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:28:22,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:22,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:22,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:22,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,675 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:28:22,675 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 19:28:22,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 19:28:22,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:22,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:22,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:28:22,871 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:28:22,896 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:22,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:28:22,904 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:22,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:22,933 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 19:28:22,933 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:28:23,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:23,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:23,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:23,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:23,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:28:23,207 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:23,264 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 19:28:23,265 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 19:28:23,265 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 19:28:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:23,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:23,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 19:28:23,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:23,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:23,407 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:23,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:23,418 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:23,479 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 19:28:23,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:23,481 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 19:28:23,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:23,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 19:28:23,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:23,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:23,662 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 19:28:23,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 19:28:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:23,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:23,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 36 [2019-12-18 19:28:23,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367957133] [2019-12-18 19:28:23,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 19:28:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 19:28:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 19:28:23,750 INFO L87 Difference]: Start difference. First operand 492 states and 1074 transitions. Second operand 38 states. [2019-12-18 19:28:24,564 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 19:28:24,929 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-18 19:28:25,230 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-18 19:28:25,493 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-12-18 19:28:26,207 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-18 19:28:26,587 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 19:28:26,876 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 19:28:27,502 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-18 19:28:27,838 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-12-18 19:28:28,337 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2019-12-18 19:28:28,651 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-12-18 19:28:29,232 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-12-18 19:28:29,695 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-12-18 19:28:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:30,237 INFO L93 Difference]: Finished difference Result 602 states and 1315 transitions. [2019-12-18 19:28:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:28:30,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-18 19:28:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:30,242 INFO L225 Difference]: With dead ends: 602 [2019-12-18 19:28:30,242 INFO L226 Difference]: Without dead ends: 602 [2019-12-18 19:28:30,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 19:28:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-18 19:28:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 449. [2019-12-18 19:28:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-18 19:28:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 983 transitions. [2019-12-18 19:28:30,249 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 983 transitions. Word has length 25 [2019-12-18 19:28:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:30,249 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 983 transitions. [2019-12-18 19:28:30,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 19:28:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 983 transitions. [2019-12-18 19:28:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:28:30,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:30,250 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:30,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:30,452 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1324684501, now seen corresponding path program 19 times [2019-12-18 19:28:30,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:30,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960422614] [2019-12-18 19:28:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:31,043 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2019-12-18 19:28:31,368 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 40 [2019-12-18 19:28:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:31,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960422614] [2019-12-18 19:28:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625948957] [2019-12-18 19:28:31,946 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:32,017 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-18 19:28:32,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:32,027 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 23 treesize of output 21 [2019-12-18 19:28:32,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:28:32,056 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:28:32,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,076 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 37 treesize of output 24 [2019-12-18 19:28:32,077 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:32,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:32,086 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:32,086 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 19:28:32,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,540 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:32,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:32,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:32,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:32,623 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:28:32,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:32,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 19:28:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:32,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:28:32,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:32,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:28:32,811 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:32,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:32,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:28:32,819 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:32,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:32,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:32,839 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 19:28:33,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:33,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:33,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:33,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:33,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:28:33,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,133 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 19:28:33,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:33,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-18 19:28:33,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:33,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:33,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:33,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 19:28:33,307 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 19:28:33,316 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,379 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 19:28:33,380 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 19:28:33,380 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:212, output treesize:46 [2019-12-18 19:28:33,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:33,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 19:28:33,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:33,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:28:33,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-18 19:28:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:33,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:33,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 19:28:33,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260222879] [2019-12-18 19:28:33,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 19:28:33,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 19:28:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1334, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:28:33,613 INFO L87 Difference]: Start difference. First operand 449 states and 983 transitions. Second operand 39 states. [2019-12-18 19:28:34,766 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-18 19:28:34,965 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-18 19:28:36,452 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-18 19:28:37,312 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-18 19:28:37,745 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-18 19:28:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:38,575 INFO L93 Difference]: Finished difference Result 543 states and 1190 transitions. [2019-12-18 19:28:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:28:38,575 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-18 19:28:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:38,579 INFO L225 Difference]: With dead ends: 543 [2019-12-18 19:28:38,579 INFO L226 Difference]: Without dead ends: 543 [2019-12-18 19:28:38,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=541, Invalid=3619, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 19:28:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-12-18 19:28:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 439. [2019-12-18 19:28:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-12-18 19:28:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 961 transitions. [2019-12-18 19:28:38,588 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 961 transitions. Word has length 25 [2019-12-18 19:28:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:38,588 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 961 transitions. [2019-12-18 19:28:38,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 19:28:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 961 transitions. [2019-12-18 19:28:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:28:38,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:38,589 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:38,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:38,793 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1550608564, now seen corresponding path program 5 times [2019-12-18 19:28:38,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:38,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354293663] [2019-12-18 19:28:38,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:39,274 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-12-18 19:28:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:39,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354293663] [2019-12-18 19:28:39,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352815150] [2019-12-18 19:28:39,610 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:39,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:28:39,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:28:39,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-18 19:28:39,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:39,697 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 23 treesize of output 21 [2019-12-18 19:28:39,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:28:39,723 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:28:39,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:39,729 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 37 treesize of output 24 [2019-12-18 19:28:39,729 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:39,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:39,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:39,740 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:28:39,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:40,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:40,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:40,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,055 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 19:28:40,055 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 19:28:40,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 19:28:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:40,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 19:28:40,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:40,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 19:28:40,139 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 19:28:40,143 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:40,154 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 19:28:40,154 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 19:28:40,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:40,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:40,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 19:28:40,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,418 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:40,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:40,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 19:28:40,424 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 19:28:40,428 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:40,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:40,439 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 19:28:40,439 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 19:28:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:40,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:40,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-12-18 19:28:40,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65339294] [2019-12-18 19:28:40,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 19:28:40,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:40,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 19:28:40,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:28:40,613 INFO L87 Difference]: Start difference. First operand 439 states and 961 transitions. Second operand 31 states. [2019-12-18 19:28:41,641 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-12-18 19:28:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:42,842 INFO L93 Difference]: Finished difference Result 475 states and 1030 transitions. [2019-12-18 19:28:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:42,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2019-12-18 19:28:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:42,846 INFO L225 Difference]: With dead ends: 475 [2019-12-18 19:28:42,846 INFO L226 Difference]: Without dead ends: 458 [2019-12-18 19:28:42,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 19:28:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-18 19:28:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 387. [2019-12-18 19:28:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-12-18 19:28:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 852 transitions. [2019-12-18 19:28:42,854 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 852 transitions. Word has length 25 [2019-12-18 19:28:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:42,854 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 852 transitions. [2019-12-18 19:28:42,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 19:28:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 852 transitions. [2019-12-18 19:28:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:28:42,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:42,855 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:43,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:43,056 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:28:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2088272730, now seen corresponding path program 20 times [2019-12-18 19:28:43,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:43,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037730763] [2019-12-18 19:28:43,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:43,663 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2019-12-18 19:28:43,908 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-12-18 19:28:44,104 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-12-18 19:28:44,247 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-18 19:28:44,477 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2019-12-18 19:28:44,669 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-12-18 19:28:44,886 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2019-12-18 19:28:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:45,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037730763] [2019-12-18 19:28:45,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518506956] [2019-12-18 19:28:45,610 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:28:45,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:28:45,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:28:45,686 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 119 conjunts are in the unsatisfiable core [2019-12-18 19:28:45,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:28:45,694 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 23 treesize of output 21 [2019-12-18 19:28:45,695 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:28:45,724 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:28:45,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:45,728 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 37 treesize of output 24 [2019-12-18 19:28:45,729 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:45,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:45,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:28:45,740 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:28:46,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:46,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:46,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:28:46,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,179 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 19:28:46,180 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 19:28:46,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 19:28:46,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:46,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:46,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:28:46,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:28:46,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:28:46,391 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:46,413 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 19:28:46,413 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:28:46,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:28:46,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:46,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 19:28:46,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,771 INFO L614 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-12-18 19:28:46,772 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 19:28:46,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:55 [2019-12-18 19:28:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:28:46,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 19:28:46,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 19:28:46,921 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:28:46,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 19:28:46,928 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:46,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:46,949 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 19:28:46,950 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 19:28:47,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:47,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 103 [2019-12-18 19:28:47,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:47,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:47,226 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 19:28:47,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:39 [2019-12-18 19:28:47,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:47,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 19:28:47,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:28:47,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:28:47,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:28:47,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 19:28:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:47,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:28:47,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 46 [2019-12-18 19:28:47,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318609321] [2019-12-18 19:28:47,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-18 19:28:47,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-18 19:28:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2045, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 19:28:47,665 INFO L87 Difference]: Start difference. First operand 387 states and 852 transitions. Second operand 48 states. [2019-12-18 19:28:48,560 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 19:28:49,129 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-18 19:28:49,454 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-18 19:28:49,662 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-18 19:28:49,952 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-18 19:28:50,215 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-18 19:28:50,434 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 54 [2019-12-18 19:28:50,682 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 58 [2019-12-18 19:28:51,103 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 56 [2019-12-18 19:28:52,596 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 19:28:52,765 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-18 19:28:53,201 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-12-18 19:28:53,383 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-12-18 19:28:53,948 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-18 19:28:54,525 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-18 19:28:54,763 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-18 19:28:54,979 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 19:28:55,586 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-12-18 19:28:56,245 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-18 19:28:56,457 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-18 19:28:57,205 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-18 19:28:57,921 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-18 19:28:58,161 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-18 19:28:58,343 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-18 19:28:58,764 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-12-18 19:28:59,335 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-18 19:28:59,739 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-12-18 19:29:00,042 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-12-18 19:29:00,378 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-18 19:29:01,102 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-18 19:29:01,368 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-18 19:29:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:03,120 INFO L93 Difference]: Finished difference Result 708 states and 1541 transitions. [2019-12-18 19:29:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-18 19:29:03,121 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 30 [2019-12-18 19:29:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:03,125 INFO L225 Difference]: With dead ends: 708 [2019-12-18 19:29:03,125 INFO L226 Difference]: Without dead ends: 708 [2019-12-18 19:29:03,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4922 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1751, Invalid=13749, Unknown=0, NotChecked=0, Total=15500 [2019-12-18 19:29:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-18 19:29:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 499. [2019-12-18 19:29:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-18 19:29:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1095 transitions. [2019-12-18 19:29:03,136 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1095 transitions. Word has length 30 [2019-12-18 19:29:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:03,136 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 1095 transitions. [2019-12-18 19:29:03,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-18 19:29:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1095 transitions. [2019-12-18 19:29:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:03,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:03,138 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:03,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:03,342 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1686493757, now seen corresponding path program 6 times [2019-12-18 19:29:03,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:03,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496523421] [2019-12-18 19:29:03,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496523421] [2019-12-18 19:29:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466599972] [2019-12-18 19:29:04,471 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:04,554 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:29:04,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:29:04,557 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 123 conjunts are in the unsatisfiable core [2019-12-18 19:29:04,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:04,572 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 23 treesize of output 21 [2019-12-18 19:29:04,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:29:04,599 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:29:04,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:04,605 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 37 treesize of output 24 [2019-12-18 19:29:04,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:04,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:04,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:04,615 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:04,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:04,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:04,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:04,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:04,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:29:04,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,050 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 19:29:05,051 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 19:29:05,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 19:29:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:05,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,195 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:05,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:29:05,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:05,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:29:05,225 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:29:05,232 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,249 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 19:29:05,249 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 19:29:05,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 19:29:05,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,509 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 19:29:05,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 19:29:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:05,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:05,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:05,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 124 [2019-12-18 19:29:05,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:05,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:05,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 114 [2019-12-18 19:29:05,943 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:05,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:05,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 113 [2019-12-18 19:29:05,987 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:06,030 INFO L614 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-12-18 19:29:06,031 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 19:29:06,031 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:45 [2019-12-18 19:29:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:06,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:29:06,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 39 [2019-12-18 19:29:06,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751185008] [2019-12-18 19:29:06,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 19:29:06,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 19:29:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1435, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 19:29:06,309 INFO L87 Difference]: Start difference. First operand 499 states and 1095 transitions. Second operand 40 states. [2019-12-18 19:29:09,220 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 19:29:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:11,565 INFO L93 Difference]: Finished difference Result 615 states and 1339 transitions. [2019-12-18 19:29:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 19:29:11,566 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-18 19:29:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:11,570 INFO L225 Difference]: With dead ends: 615 [2019-12-18 19:29:11,570 INFO L226 Difference]: Without dead ends: 615 [2019-12-18 19:29:11,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=395, Invalid=3637, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 19:29:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-12-18 19:29:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 578. [2019-12-18 19:29:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-18 19:29:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1265 transitions. [2019-12-18 19:29:11,578 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1265 transitions. Word has length 30 [2019-12-18 19:29:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:11,578 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 1265 transitions. [2019-12-18 19:29:11,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 19:29:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1265 transitions. [2019-12-18 19:29:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:11,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:11,579 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:11,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:11,783 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2084976497, now seen corresponding path program 7 times [2019-12-18 19:29:11,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:11,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318361929] [2019-12-18 19:29:11,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318361929] [2019-12-18 19:29:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444826076] [2019-12-18 19:29:12,897 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:12,980 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 120 conjunts are in the unsatisfiable core [2019-12-18 19:29:12,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:12,990 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 38 treesize of output 34 [2019-12-18 19:29:12,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,010 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:29:13,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,014 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 37 treesize of output 24 [2019-12-18 19:29:13,015 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:13,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:13,027 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:13,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:13,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:13,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:29:13,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,446 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 19:29:13,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:13,447 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-18 19:29:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:13,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:13,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:29:13,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:13,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:29:13,600 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:13,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:29:13,605 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:13,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:13,622 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:251, output treesize:43 [2019-12-18 19:29:13,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:13,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 19:29:13,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:13,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:13,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:13,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:45 [2019-12-18 19:29:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:14,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:14,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:14,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-18 19:29:14,098 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:14,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:14,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:14,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 19:29:14,125 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:14,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-18 19:29:14,129 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:14,155 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.7 percent of original size [2019-12-18 19:29:14,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:14,156 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:219, output treesize:35 [2019-12-18 19:29:14,320 INFO L343 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2019-12-18 19:29:14,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 55 [2019-12-18 19:29:14,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:14,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:14,327 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 19:29:14,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:7 [2019-12-18 19:29:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:14,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:29:14,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 19:29:14,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007651878] [2019-12-18 19:29:14,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 19:29:14,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 19:29:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 19:29:14,418 INFO L87 Difference]: Start difference. First operand 578 states and 1265 transitions. Second operand 38 states. [2019-12-18 19:29:15,864 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-12-18 19:29:16,310 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-18 19:29:16,777 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-18 19:29:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:20,201 INFO L93 Difference]: Finished difference Result 632 states and 1359 transitions. [2019-12-18 19:29:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 19:29:20,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-18 19:29:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:20,205 INFO L225 Difference]: With dead ends: 632 [2019-12-18 19:29:20,205 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 19:29:20,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=626, Invalid=4776, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 19:29:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 19:29:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 576. [2019-12-18 19:29:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 19:29:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1261 transitions. [2019-12-18 19:29:20,214 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1261 transitions. Word has length 30 [2019-12-18 19:29:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:20,214 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1261 transitions. [2019-12-18 19:29:20,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 19:29:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1261 transitions. [2019-12-18 19:29:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:20,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:20,215 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:20,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:20,416 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 6218509, now seen corresponding path program 8 times [2019-12-18 19:29:20,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:20,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850152955] [2019-12-18 19:29:20,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:21,041 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-12-18 19:29:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:22,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850152955] [2019-12-18 19:29:22,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290153578] [2019-12-18 19:29:22,142 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:22,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:29:22,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:29:22,228 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-18 19:29:22,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:22,253 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 23 treesize of output 21 [2019-12-18 19:29:22,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:29:22,284 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:29:22,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,288 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 37 treesize of output 24 [2019-12-18 19:29:22,289 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:22,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:22,298 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:22,298 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:22,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:22,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:22,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:29:22,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:22,677 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:29:22,677 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 19:29:22,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-18 19:29:22,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:22,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:22,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:22,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:29:22,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:22,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:22,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:29:22,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:22,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:22,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:29:22,838 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:22,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:22,852 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 19:29:22,852 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-18 19:29:23,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:23,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:23,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:23,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 19:29:23,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:23,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:23,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 19:29:23,222 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:23,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 19:29:23,229 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:23,247 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 19:29:23,247 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:40 [2019-12-18 19:29:23,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-18 19:29:23,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:23,332 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 19:29:23,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2019-12-18 19:29:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:23,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,453 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,455 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-18 19:29:23,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:23,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-18 19:29:23,465 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:23,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:23,471 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 19:29:23,471 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-18 19:29:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:23,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:29:23,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2019-12-18 19:29:23,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289521396] [2019-12-18 19:29:23,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 19:29:23,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 19:29:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:29:23,516 INFO L87 Difference]: Start difference. First operand 576 states and 1261 transitions. Second operand 39 states. [2019-12-18 19:29:24,374 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-12-18 19:29:24,612 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2019-12-18 19:29:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:26,192 INFO L93 Difference]: Finished difference Result 619 states and 1340 transitions. [2019-12-18 19:29:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 19:29:26,193 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-12-18 19:29:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:26,196 INFO L225 Difference]: With dead ends: 619 [2019-12-18 19:29:26,197 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 19:29:26,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=299, Invalid=2457, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 19:29:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 19:29:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 582. [2019-12-18 19:29:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-18 19:29:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1273 transitions. [2019-12-18 19:29:26,204 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1273 transitions. Word has length 30 [2019-12-18 19:29:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:26,204 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1273 transitions. [2019-12-18 19:29:26,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 19:29:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1273 transitions. [2019-12-18 19:29:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:26,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:26,205 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:26,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:26,407 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash -383631969, now seen corresponding path program 9 times [2019-12-18 19:29:26,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:26,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164118534] [2019-12-18 19:29:26,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:27,518 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-12-18 19:29:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:27,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164118534] [2019-12-18 19:29:27,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857905111] [2019-12-18 19:29:27,698 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:27,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:29:27,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:29:27,792 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 105 conjunts are in the unsatisfiable core [2019-12-18 19:29:27,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:27,803 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 23 treesize of output 21 [2019-12-18 19:29:27,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:29:27,827 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:29:27,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:27,832 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 37 treesize of output 24 [2019-12-18 19:29:27,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:27,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:27,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:27,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:28,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:28,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:28,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:29:28,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,228 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 19:29:28,229 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 19:29:28,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-18 19:29:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:28,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:28,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:29:28,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:28,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:29:28,396 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:29:28,402 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:28,418 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 19:29:28,418 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-18 19:29:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:28,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:28,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 19:29:28,760 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,772 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:28,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 19:29:28,779 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:28,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 19:29:28,785 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:28,802 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 19:29:28,802 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:46 [2019-12-18 19:29:28,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:28,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 19:29:28,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:28,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:28,906 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 19:29:28,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2019-12-18 19:29:29,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:29,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:29,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:29,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:29,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-18 19:29:29,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:29,072 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:29,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-18 19:29:29,073 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:29,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:29,079 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 19:29:29,080 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-18 19:29:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:29,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:29:29,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 37 [2019-12-18 19:29:29,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420671673] [2019-12-18 19:29:29,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 19:29:29,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:29,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 19:29:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 19:29:29,133 INFO L87 Difference]: Start difference. First operand 582 states and 1273 transitions. Second operand 38 states. [2019-12-18 19:29:30,331 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-12-18 19:29:30,583 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-12-18 19:29:30,764 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-12-18 19:29:31,072 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-12-18 19:29:31,560 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2019-12-18 19:29:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:33,425 INFO L93 Difference]: Finished difference Result 627 states and 1356 transitions. [2019-12-18 19:29:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 19:29:33,426 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-18 19:29:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:33,430 INFO L225 Difference]: With dead ends: 627 [2019-12-18 19:29:33,430 INFO L226 Difference]: Without dead ends: 617 [2019-12-18 19:29:33,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=532, Invalid=3628, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 19:29:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-18 19:29:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 580. [2019-12-18 19:29:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 19:29:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1269 transitions. [2019-12-18 19:29:33,440 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1269 transitions. Word has length 30 [2019-12-18 19:29:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:33,440 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1269 transitions. [2019-12-18 19:29:33,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 19:29:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1269 transitions. [2019-12-18 19:29:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:33,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:33,442 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:33,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:33,645 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1470594389, now seen corresponding path program 10 times [2019-12-18 19:29:33,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:33,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892927946] [2019-12-18 19:29:33,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:34,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892927946] [2019-12-18 19:29:34,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511207003] [2019-12-18 19:29:34,892 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:34,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:29:34,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:29:34,965 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 122 conjunts are in the unsatisfiable core [2019-12-18 19:29:34,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:34,975 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 23 treesize of output 21 [2019-12-18 19:29:34,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:29:35,001 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 19:29:35,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,006 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 37 treesize of output 24 [2019-12-18 19:29:35,006 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:35,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:35,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:35,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:35,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:35,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 19:29:35,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,409 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 19:29:35,410 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 19:29:35,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 19:29:35,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:35,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:35,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:35,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 19:29:35,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:35,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 19:29:35,571 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 19:29:35,578 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:35,597 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 19:29:35,598 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 19:29:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:29:35,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,975 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:35,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 19:29:35,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:35,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:35,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:29:35,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:36,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 19:29:36,002 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:36,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:36,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 19:29:36,008 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:36,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:36,029 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 19:29:36,029 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:46 [2019-12-18 19:29:36,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-18 19:29:36,094 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:36,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:36,111 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 19:29:36,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2019-12-18 19:29:36,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:36,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 19:29:36,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:36,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:36,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:29:36,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 19:29:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:36,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:29:36,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 38 [2019-12-18 19:29:36,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502279490] [2019-12-18 19:29:36,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 19:29:36,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 19:29:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:29:36,326 INFO L87 Difference]: Start difference. First operand 580 states and 1269 transitions. Second operand 39 states. [2019-12-18 19:29:37,178 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-18 19:29:37,754 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-12-18 19:29:38,179 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 19:29:38,649 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 19:29:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:41,321 INFO L93 Difference]: Finished difference Result 636 states and 1375 transitions. [2019-12-18 19:29:41,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 19:29:41,322 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-12-18 19:29:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:41,326 INFO L225 Difference]: With dead ends: 636 [2019-12-18 19:29:41,326 INFO L226 Difference]: Without dead ends: 624 [2019-12-18 19:29:41,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=567, Invalid=4403, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 19:29:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-18 19:29:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 579. [2019-12-18 19:29:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-18 19:29:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1267 transitions. [2019-12-18 19:29:41,334 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1267 transitions. Word has length 30 [2019-12-18 19:29:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:41,335 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1267 transitions. [2019-12-18 19:29:41,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 19:29:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1267 transitions. [2019-12-18 19:29:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:29:41,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:41,336 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:41,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:41,537 INFO L410 AbstractCegarLoop]: === Iteration 37 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:29:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -48444409, now seen corresponding path program 11 times [2019-12-18 19:29:41,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:41,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566680927] [2019-12-18 19:29:41,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:42,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566680927] [2019-12-18 19:29:42,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921253196] [2019-12-18 19:29:42,622 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:42,705 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:29:42,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:29:42,707 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 128 conjunts are in the unsatisfiable core [2019-12-18 19:29:42,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:29:42,715 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 38 treesize of output 34 [2019-12-18 19:29:42,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:42,731 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 19:29:42,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:42,735 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 37 treesize of output 24 [2019-12-18 19:29:42,736 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:29:42,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:29:42,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:29:42,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 19:29:43,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:43,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:29:43,044 INFO L172 IndexEqualityManager]: detected equality via solver Received shutdown request... [2019-12-18 19:29:43,061 WARN L209 SmtUtils]: Removed 4 from assertion stack [2019-12-18 19:29:43,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:29:43,262 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:29:43,267 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:29:43,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:29:43 BasicIcfg [2019-12-18 19:29:43,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:29:43,268 INFO L168 Benchmark]: Toolchain (without parser) took 244399.11 ms. Allocated memory was 145.8 MB in the beginning and 339.7 MB in the end (delta: 194.0 MB). Free memory was 100.6 MB in the beginning and 57.5 MB in the end (delta: 43.1 MB). Peak memory consumption was 237.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,269 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.92 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.2 MB in the beginning and 148.6 MB in the end (delta: -48.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.08 ms. Allocated memory is still 202.4 MB. Free memory was 147.9 MB in the beginning and 146.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,269 INFO L168 Benchmark]: Boogie Preprocessor took 51.56 ms. Allocated memory is still 202.4 MB. Free memory was 145.3 MB in the beginning and 144.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,270 INFO L168 Benchmark]: RCFGBuilder took 634.35 ms. Allocated memory is still 202.4 MB. Free memory was 144.0 MB in the beginning and 113.7 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,270 INFO L168 Benchmark]: TraceAbstraction took 242900.70 ms. Allocated memory was 202.4 MB in the beginning and 339.7 MB in the end (delta: 137.4 MB). Free memory was 113.7 MB in the beginning and 57.5 MB in the end (delta: 56.2 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:43,271 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.92 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.2 MB in the beginning and 148.6 MB in the end (delta: -48.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.08 ms. Allocated memory is still 202.4 MB. Free memory was 147.9 MB in the beginning and 146.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.56 ms. Allocated memory is still 202.4 MB. Free memory was 145.3 MB in the beginning and 144.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 634.35 ms. Allocated memory is still 202.4 MB. Free memory was 144.0 MB in the beginning and 113.7 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242900.70 ms. Allocated memory was 202.4 MB in the beginning and 339.7 MB in the end (delta: 137.4 MB). Free memory was 113.7 MB in the beginning and 57.5 MB in the end (delta: 56.2 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 2682 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 5902 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 821]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 821). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 15ms.. - TimeoutResultAtElement [Line: 825]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 825). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 15ms.. - TimeoutResultAtElement [Line: 826]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 826). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 242.7s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 159.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1024 SDtfs, 5939 SDslu, 7281 SDs, 0 SdLazy, 55475 SolverSat, 2153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2090 GetRequests, 240 SyntacticMatches, 92 SemanticMatches, 1758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29400 ImplicationChecksByTransitivity, 147.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 3372 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 68.5s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1370 ConstructedInterpolants, 473 QuantifiedInterpolants, 1159738 SizeOfPredicates, 1027 NumberOfNonLiveVariables, 4098 ConjunctsInSsa, 2340 ConjunctsInUnsatCore, 61 InterpolantComputations, 11 PerfectInterpolantSequences, 52/378 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown