/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:28:00,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:28:00,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:28:00,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:28:00,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:28:00,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:28:00,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:28:00,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:28:00,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:28:00,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:28:00,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:28:00,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:28:00,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:28:00,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:28:00,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:28:00,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:28:00,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:28:00,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:28:00,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:28:00,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:28:00,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:28:00,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:28:00,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:28:00,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:28:00,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:28:00,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:28:00,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:28:00,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:28:00,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:28:00,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:28:00,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:28:00,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:28:00,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:28:00,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:28:00,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:28:00,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:28:00,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:28:00,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:28:00,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:28:00,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:28:00,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:28:00,453 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-VariableLbe.epf [2019-12-27 08:28:00,481 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:28:00,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:28:00,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:28:00,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:28:00,483 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:28:00,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:28:00,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:28:00,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:28:00,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:28:00,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:28:00,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:28:00,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:28:00,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:28:00,485 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:28:00,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:28:00,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:28:00,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:28:00,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:28:00,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:28:00,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:28:00,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:28:00,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:28:00,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:28:00,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:28:00,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:28:00,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:28:00,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:28:00,487 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:28:00,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:28:00,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:28:00,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:28:00,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:28:00,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:28:00,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:28:00,797 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:28:00,798 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-27 08:28:00,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fb6c41/13afa8725e7a4520a309bdf09b1dd5b8/FLAG6e8deb969 [2019-12-27 08:28:01,409 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:28:01,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-27 08:28:01,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fb6c41/13afa8725e7a4520a309bdf09b1dd5b8/FLAG6e8deb969 [2019-12-27 08:28:01,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fb6c41/13afa8725e7a4520a309bdf09b1dd5b8 [2019-12-27 08:28:01,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:28:01,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:28:01,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:28:01,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:28:01,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:28:01,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:01" (1/1) ... [2019-12-27 08:28:01,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8ce243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:01, skipping insertion in model container [2019-12-27 08:28:01,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:01" (1/1) ... [2019-12-27 08:28:01,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:28:01,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:28:01,924 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 08:28:02,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:28:02,262 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:28:02,277 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 08:28:02,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:28:02,425 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:28:02,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02 WrapperNode [2019-12-27 08:28:02,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:28:02,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:28:02,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:28:02,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:28:02,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:28:02,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:28:02,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:28:02,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:28:02,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... [2019-12-27 08:28:02,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:28:02,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:28:02,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:28:02,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:28:02,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:28:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-27 08:28:02,603 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-27 08:28:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:28:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:28:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 08:28:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:28:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:28:02,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:28:02,607 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:28:03,085 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:28:03,085 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-27 08:28:03,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:03 BoogieIcfgContainer [2019-12-27 08:28:03,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:28:03,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:28:03,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:28:03,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:28:03,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:28:01" (1/3) ... [2019-12-27 08:28:03,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b1fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:03, skipping insertion in model container [2019-12-27 08:28:03,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:02" (2/3) ... [2019-12-27 08:28:03,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b1fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:03, skipping insertion in model container [2019-12-27 08:28:03,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:03" (3/3) ... [2019-12-27 08:28:03,094 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-27 08:28:03,105 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:28:03,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:28:03,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-27 08:28:03,114 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:28:03,147 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,147 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,147 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,147 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,148 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,148 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,148 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,148 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,149 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,149 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,149 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,150 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,150 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,150 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,150 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,151 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,151 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,151 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,151 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,152 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,152 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,152 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,153 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,153 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,153 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,154 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,154 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,154 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,154 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,154 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,155 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,155 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,155 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,155 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,155 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,156 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,156 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,156 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,156 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,157 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,157 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,157 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,157 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,158 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,158 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,158 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,158 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,159 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,159 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,159 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,159 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,159 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,160 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,160 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,160 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,160 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,161 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,161 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,161 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,161 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,162 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,162 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,162 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,162 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,162 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,163 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,163 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,163 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,163 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,164 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,164 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,164 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,164 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,165 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,165 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,165 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,165 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,166 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,166 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,166 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,166 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,167 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,167 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,167 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,167 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,167 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,168 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,168 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,168 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,168 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,169 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,169 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,169 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,169 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,170 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,170 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,170 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,170 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,170 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,171 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,171 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,171 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,171 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,172 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,172 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,172 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,172 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,173 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,173 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,173 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,173 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,174 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,174 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,174 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,174 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,175 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,175 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,175 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,175 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,176 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,176 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,176 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,176 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,177 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,177 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,177 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,178 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,178 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,182 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,183 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,183 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,183 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,183 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,184 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,184 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,184 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,184 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,184 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,185 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,185 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,185 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,185 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,186 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,186 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,186 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,186 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,187 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,187 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,187 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,187 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,187 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,188 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,188 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,188 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,188 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,189 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,189 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:03,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 08:28:03,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:28:03,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:28:03,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:28:03,226 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:28:03,226 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:28:03,226 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:28:03,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:28:03,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:28:03,243 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-27 08:28:03,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 08:28:03,354 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 08:28:03,354 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 08:28:03,365 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-27 08:28:03,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 08:28:03,406 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 08:28:03,406 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 08:28:03,409 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-27 08:28:03,414 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-27 08:28:03,416 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:28:05,563 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-27 08:28:06,033 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5914 [2019-12-27 08:28:06,033 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 08:28:06,037 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-27 08:28:06,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-27 08:28:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-27 08:28:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:28:06,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:06,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:28:06,060 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-27 08:28:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 485339031, now seen corresponding path program 1 times [2019-12-27 08:28:06,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:06,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079891217] [2019-12-27 08:28:06,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:06,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079891217] [2019-12-27 08:28:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:06,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:28:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811485363] [2019-12-27 08:28:06,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 08:28:06,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 08:28:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:28:06,243 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-27 08:28:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:06,265 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-27 08:28:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 08:28:06,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-27 08:28:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:06,280 INFO L225 Difference]: With dead ends: 139 [2019-12-27 08:28:06,281 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 08:28:06,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:28:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 08:28:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-27 08:28:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-27 08:28:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-27 08:28:06,333 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-27 08:28:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:06,334 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-27 08:28:06,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 08:28:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-27 08:28:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 08:28:06,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:06,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 08:28:06,335 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-27 08:28:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2134363384, now seen corresponding path program 1 times [2019-12-27 08:28:06,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:06,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572005308] [2019-12-27 08:28:06,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:06,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572005308] [2019-12-27 08:28:06,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:06,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:28:06,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877777992] [2019-12-27 08:28:06,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:28:06,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:28:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:28:06,413 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-27 08:28:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:06,437 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-27 08:28:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:28:06,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 08:28:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:06,441 INFO L225 Difference]: With dead ends: 200 [2019-12-27 08:28:06,441 INFO L226 Difference]: Without dead ends: 200 [2019-12-27 08:28:06,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:28:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-27 08:28:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-27 08:28:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-27 08:28:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-27 08:28:06,462 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-27 08:28:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:06,466 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-27 08:28:06,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:28:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-27 08:28:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 08:28:06,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:06,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:06,468 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-27 08:28:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1264596255, now seen corresponding path program 1 times [2019-12-27 08:28:06,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351841026] [2019-12-27 08:28:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351841026] [2019-12-27 08:28:06,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:06,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:28:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327533068] [2019-12-27 08:28:06,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:28:06,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:28:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:28:06,661 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-27 08:28:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:06,975 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-27 08:28:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:28:06,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 08:28:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:06,977 INFO L225 Difference]: With dead ends: 181 [2019-12-27 08:28:06,978 INFO L226 Difference]: Without dead ends: 162 [2019-12-27 08:28:06,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:28:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-27 08:28:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-27 08:28:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 08:28:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-27 08:28:06,994 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-27 08:28:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:06,994 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-27 08:28:06,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:28:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-27 08:28:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:28:06,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:06,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:06,996 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-27 08:28:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash -328941052, now seen corresponding path program 1 times [2019-12-27 08:28:06,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:06,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808542444] [2019-12-27 08:28:06,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:07,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808542444] [2019-12-27 08:28:07,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:07,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:28:07,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727904415] [2019-12-27 08:28:07,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:28:07,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:28:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:28:07,527 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 12 states. [2019-12-27 08:28:08,472 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-27 08:28:08,665 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-27 08:28:09,018 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 08:28:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:09,482 INFO L93 Difference]: Finished difference Result 205 states and 441 transitions. [2019-12-27 08:28:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:28:09,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 08:28:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:09,484 INFO L225 Difference]: With dead ends: 205 [2019-12-27 08:28:09,485 INFO L226 Difference]: Without dead ends: 195 [2019-12-27 08:28:09,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:28:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-27 08:28:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2019-12-27 08:28:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 08:28:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions. [2019-12-27 08:28:09,498 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 16 [2019-12-27 08:28:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:09,498 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions. [2019-12-27 08:28:09,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:28:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions. [2019-12-27 08:28:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:28:09,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:09,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:09,500 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-27 08:28:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1380096900, now seen corresponding path program 2 times [2019-12-27 08:28:09,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:09,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146822666] [2019-12-27 08:28:09,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:09,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146822666] [2019-12-27 08:28:09,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:09,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:28:09,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924976642] [2019-12-27 08:28:09,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:28:09,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:28:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:28:09,917 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand 13 states. [2019-12-27 08:28:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:11,846 INFO L93 Difference]: Finished difference Result 218 states and 464 transitions. [2019-12-27 08:28:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:28:11,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 08:28:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:11,849 INFO L225 Difference]: With dead ends: 218 [2019-12-27 08:28:11,849 INFO L226 Difference]: Without dead ends: 208 [2019-12-27 08:28:11,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:28:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-27 08:28:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 185. [2019-12-27 08:28:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-27 08:28:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 401 transitions. [2019-12-27 08:28:11,860 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 401 transitions. Word has length 16 [2019-12-27 08:28:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:11,861 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 401 transitions. [2019-12-27 08:28:11,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:28:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 401 transitions. [2019-12-27 08:28:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:28:11,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:11,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:11,863 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-27 08:28:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 391036352, now seen corresponding path program 3 times [2019-12-27 08:28:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:11,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648941861] [2019-12-27 08:28:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:12,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648941861] [2019-12-27 08:28:12,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:12,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:28:12,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136220878] [2019-12-27 08:28:12,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:28:12,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:28:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:28:12,250 INFO L87 Difference]: Start difference. First operand 185 states and 401 transitions. Second operand 13 states. [2019-12-27 08:28:13,379 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-27 08:28:13,851 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 08:28:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:14,313 INFO L93 Difference]: Finished difference Result 216 states and 456 transitions. [2019-12-27 08:28:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 08:28:14,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 08:28:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:14,318 INFO L225 Difference]: With dead ends: 216 [2019-12-27 08:28:14,318 INFO L226 Difference]: Without dead ends: 206 [2019-12-27 08:28:14,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:28:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-27 08:28:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2019-12-27 08:28:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-27 08:28:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 401 transitions. [2019-12-27 08:28:14,328 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 401 transitions. Word has length 16 [2019-12-27 08:28:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:14,328 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 401 transitions. [2019-12-27 08:28:14,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:28:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 401 transitions. [2019-12-27 08:28:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:28:14,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:14,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:14,330 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-27 08:28:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1177563524, now seen corresponding path program 4 times [2019-12-27 08:28:14,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:14,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636231541] [2019-12-27 08:28:14,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:14,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636231541] [2019-12-27 08:28:14,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:14,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:28:14,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378758292] [2019-12-27 08:28:14,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:28:14,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:28:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:28:14,714 INFO L87 Difference]: Start difference. First operand 185 states and 401 transitions. Second operand 12 states. [2019-12-27 08:28:15,826 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-27 08:28:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:16,200 INFO L93 Difference]: Finished difference Result 201 states and 426 transitions. [2019-12-27 08:28:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:28:16,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 08:28:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:16,202 INFO L225 Difference]: With dead ends: 201 [2019-12-27 08:28:16,202 INFO L226 Difference]: Without dead ends: 191 [2019-12-27 08:28:16,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:28:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-27 08:28:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2019-12-27 08:28:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-27 08:28:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-27 08:28:16,210 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-27 08:28:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:16,210 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-27 08:28:16,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:28:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-27 08:28:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:16,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:16,212 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-27 08:28:16,212 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-27 08:28:16,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash -960067854, now seen corresponding path program 1 times [2019-12-27 08:28:16,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:16,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965545490] [2019-12-27 08:28:16,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:17,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965545490] [2019-12-27 08:28:17,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:17,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:28:17,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156984580] [2019-12-27 08:28:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:28:17,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:28:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:28:17,171 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 16 states. [2019-12-27 08:28:18,097 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-27 08:28:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:18,816 INFO L93 Difference]: Finished difference Result 261 states and 568 transitions. [2019-12-27 08:28:18,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:28:18,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 08:28:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:18,819 INFO L225 Difference]: With dead ends: 261 [2019-12-27 08:28:18,819 INFO L226 Difference]: Without dead ends: 261 [2019-12-27 08:28:18,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:28:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-27 08:28:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-27 08:28:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 08:28:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 08:28:18,829 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 08:28:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:18,831 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 08:28:18,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:28:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 08:28:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:18,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:18,842 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-27 08:28:18,843 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-27 08:28:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 747896946, now seen corresponding path program 2 times [2019-12-27 08:28:18,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:18,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818947716] [2019-12-27 08:28:18,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:19,332 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-12-27 08:28:19,459 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-12-27 08:28:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:19,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818947716] [2019-12-27 08:28:19,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:19,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:19,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422018630] [2019-12-27 08:28:19,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:28:19,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:28:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:28:19,770 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-27 08:28:20,570 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-27 08:28:20,778 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2019-12-27 08:28:20,987 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-27 08:28:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:21,820 INFO L93 Difference]: Finished difference Result 307 states and 673 transitions. [2019-12-27 08:28:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:28:21,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 08:28:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:21,822 INFO L225 Difference]: With dead ends: 307 [2019-12-27 08:28:21,822 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 08:28:21,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:28:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 08:28:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2019-12-27 08:28:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 08:28:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 08:28:21,831 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 08:28:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:21,831 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 08:28:21,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:28:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 08:28:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:21,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:21,832 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-27 08:28:21,832 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-27 08:28:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -603037424, now seen corresponding path program 3 times [2019-12-27 08:28:21,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:21,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677585929] [2019-12-27 08:28:21,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:22,281 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-12-27 08:28:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:22,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677585929] [2019-12-27 08:28:22,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:22,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:22,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288319077] [2019-12-27 08:28:22,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:28:22,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:28:22,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:28:22,630 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-27 08:28:23,392 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-12-27 08:28:23,574 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-12-27 08:28:23,722 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-27 08:28:23,933 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-12-27 08:28:24,097 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-27 08:28:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:24,940 INFO L93 Difference]: Finished difference Result 304 states and 667 transitions. [2019-12-27 08:28:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:28:24,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 08:28:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:24,943 INFO L225 Difference]: With dead ends: 304 [2019-12-27 08:28:24,944 INFO L226 Difference]: Without dead ends: 304 [2019-12-27 08:28:24,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:28:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-27 08:28:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-12-27 08:28:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 08:28:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 08:28:24,952 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 08:28:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:24,952 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 08:28:24,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:28:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 08:28:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:24,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:24,954 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-27 08:28:24,954 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-27 08:28:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1345703600, now seen corresponding path program 4 times [2019-12-27 08:28:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:24,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49343727] [2019-12-27 08:28:24,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:25,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49343727] [2019-12-27 08:28:25,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:25,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:25,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063843807] [2019-12-27 08:28:25,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:28:25,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:28:25,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:28:25,603 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-27 08:28:26,292 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-12-27 08:28:26,554 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-27 08:28:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:27,439 INFO L93 Difference]: Finished difference Result 419 states and 934 transitions. [2019-12-27 08:28:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:28:27,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 08:28:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:27,443 INFO L225 Difference]: With dead ends: 419 [2019-12-27 08:28:27,443 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 08:28:27,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:28:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 08:28:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 243. [2019-12-27 08:28:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-27 08:28:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-27 08:28:27,454 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-27 08:28:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:27,455 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-27 08:28:27,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:28:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-27 08:28:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:27,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:27,456 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-27 08:28:27,456 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-27 08:28:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -551517266, now seen corresponding path program 5 times [2019-12-27 08:28:27,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:27,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31361781] [2019-12-27 08:28:27,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:28,123 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-12-27 08:28:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:28,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31361781] [2019-12-27 08:28:28,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:28,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:28,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576680733] [2019-12-27 08:28:28,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:28:28,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:28:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:28:28,439 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 15 states. [2019-12-27 08:28:29,074 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-27 08:28:29,352 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-27 08:28:29,590 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2019-12-27 08:28:29,799 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 08:28:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:30,636 INFO L93 Difference]: Finished difference Result 322 states and 704 transitions. [2019-12-27 08:28:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:28:30,636 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 08:28:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:30,639 INFO L225 Difference]: With dead ends: 322 [2019-12-27 08:28:30,640 INFO L226 Difference]: Without dead ends: 322 [2019-12-27 08:28:30,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:28:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-27 08:28:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2019-12-27 08:28:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-27 08:28:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-27 08:28:30,648 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-27 08:28:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:30,648 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-27 08:28:30,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:28:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-27 08:28:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:30,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:30,649 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-27 08:28:30,649 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-27 08:28:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash -442477206, now seen corresponding path program 6 times [2019-12-27 08:28:30,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:30,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012423293] [2019-12-27 08:28:30,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:31,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012423293] [2019-12-27 08:28:31,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:31,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:28:31,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954202090] [2019-12-27 08:28:31,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:28:31,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:28:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:28:31,379 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 16 states. [2019-12-27 08:28:32,074 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-12-27 08:28:32,388 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-27 08:28:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:33,096 INFO L93 Difference]: Finished difference Result 301 states and 662 transitions. [2019-12-27 08:28:33,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:28:33,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 08:28:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:33,099 INFO L225 Difference]: With dead ends: 301 [2019-12-27 08:28:33,099 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 08:28:33,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:28:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 08:28:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 222. [2019-12-27 08:28:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 08:28:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-27 08:28:33,105 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-27 08:28:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:33,106 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-27 08:28:33,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:28:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-27 08:28:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:28:33,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:33,107 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-27 08:28:33,107 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-27 08:28:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1193789261, now seen corresponding path program 1 times [2019-12-27 08:28:33,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:33,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392806700] [2019-12-27 08:28:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:33,149 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-27 08:28:33,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392806700] [2019-12-27 08:28:33,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115662492] [2019-12-27 08:28:33,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:28:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:33,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-27 08:28:33,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:28:33,260 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-27 08:28:33,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:28:33,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-27 08:28:33,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797712464] [2019-12-27 08:28:33,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:28:33,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:28:33,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:28:33,262 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 4 states. [2019-12-27 08:28:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:33,280 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-27 08:28:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:28:33,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 08:28:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:33,284 INFO L225 Difference]: With dead ends: 326 [2019-12-27 08:28:33,284 INFO L226 Difference]: Without dead ends: 326 [2019-12-27 08:28:33,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:28:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-27 08:28:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-27 08:28:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-27 08:28:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-27 08:28:33,294 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-27 08:28:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:33,295 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-27 08:28:33,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:28:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-27 08:28:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:28:33,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:33,297 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-27 08:28:33,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:28:33,501 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-27 08:28:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:33,502 INFO L82 PathProgramCache]: Analyzing trace with hash 554824476, now seen corresponding path program 7 times [2019-12-27 08:28:33,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:33,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958131340] [2019-12-27 08:28:33,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:34,069 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-12-27 08:28:34,307 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-12-27 08:28:34,789 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-27 08:28:34,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958131340] [2019-12-27 08:28:34,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244877104] [2019-12-27 08:28:34,790 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-27 08:28:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:34,874 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 94 conjunts are in the unsatisfiable core [2019-12-27 08:28:34,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:28:34,940 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-27 08:28:34,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:34,968 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:28:34,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:34,977 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-27 08:28:34,978 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:34,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:34,991 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-27 08:28:34,991 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:28:35,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:28:35,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:35,603 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-27 08:28:35,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:35,661 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 08:28:35,662 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-27 08:28:35,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 08:28:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:35,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,828 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-27 08:28:35,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:35,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,867 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-27 08:28:35,868 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:35,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:35,882 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-27 08:28:35,883 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:35,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:35,910 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-27 08:28:35,910 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 08:28:36,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:36,165 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-27 08:28:36,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:36,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:36,181 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-27 08:28:36,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:39 [2019-12-27 08:28:36,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:36,335 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-27 08:28:36,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:36,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:36,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:28:36,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:7 [2019-12-27 08:28:36,452 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-27 08:28:36,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:28:36,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 08:28:36,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449218361] [2019-12-27 08:28:36,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 08:28:36,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 08:28:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:28:36,455 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 36 states. [2019-12-27 08:28:37,163 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-12-27 08:28:37,515 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-27 08:28:37,774 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-27 08:28:38,055 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-12-27 08:28:39,228 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-27 08:28:39,595 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 08:28:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:41,250 INFO L93 Difference]: Finished difference Result 457 states and 1009 transitions. [2019-12-27 08:28:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:28:41,251 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 08:28:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:41,255 INFO L225 Difference]: With dead ends: 457 [2019-12-27 08:28:41,255 INFO L226 Difference]: Without dead ends: 457 [2019-12-27 08:28:41,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=437, Invalid=2869, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 08:28:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-12-27 08:28:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 340. [2019-12-27 08:28:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 08:28:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 762 transitions. [2019-12-27 08:28:41,266 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 762 transitions. Word has length 23 [2019-12-27 08:28:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:41,266 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 762 transitions. [2019-12-27 08:28:41,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 08:28:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 762 transitions. [2019-12-27 08:28:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:28:41,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:41,267 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-27 08:28:41,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:28:41,479 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-27 08:28:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1472960100, now seen corresponding path program 8 times [2019-12-27 08:28:41,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:41,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592646769] [2019-12-27 08:28:41,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:41,884 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-12-27 08:28:42,203 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-27 08:28:42,377 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-27 08:28:43,132 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-27 08:28:43,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592646769] [2019-12-27 08:28:43,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842199794] [2019-12-27 08:28:43,133 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-27 08:28:43,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:28:43,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:28:43,217 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-27 08:28:43,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:28:43,245 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-27 08:28:43,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:43,266 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:28:43,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:43,272 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-27 08:28:43,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:43,281 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:43,282 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-27 08:28:43,282 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:28:43,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:43,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:43,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:28:43,814 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:43,814 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-27 08:28:43,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:43,872 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 08:28:43,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-27 08:28:43,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 08:28:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:44,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,075 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-27 08:28:44,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,103 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-27 08:28:44,104 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:44,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, 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-27 08:28:44,112 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:44,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:28:44,156 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 08:28:44,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:44,449 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-27 08:28:44,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,511 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 08:28:44,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:44,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:28:44,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 08:28:44,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:44,644 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-27 08:28:44,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:44,650 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:28:44,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 08:28:44,729 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-27 08:28:44,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:28:44,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 08:28:44,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779602767] [2019-12-27 08:28:44,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 08:28:44,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 08:28:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:28:44,731 INFO L87 Difference]: Start difference. First operand 340 states and 762 transitions. Second operand 36 states. [2019-12-27 08:28:45,815 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-12-27 08:28:46,095 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-12-27 08:28:46,377 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-12-27 08:28:48,305 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 08:28:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:50,189 INFO L93 Difference]: Finished difference Result 444 states and 982 transitions. [2019-12-27 08:28:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 08:28:50,190 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 08:28:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:50,192 INFO L225 Difference]: With dead ends: 444 [2019-12-27 08:28:50,193 INFO L226 Difference]: Without dead ends: 444 [2019-12-27 08:28:50,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=483, Invalid=3299, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 08:28:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-27 08:28:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 384. [2019-12-27 08:28:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 08:28:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 862 transitions. [2019-12-27 08:28:50,204 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 862 transitions. Word has length 23 [2019-12-27 08:28:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:50,204 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 862 transitions. [2019-12-27 08:28:50,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 08:28:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 862 transitions. [2019-12-27 08:28:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:28:50,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:50,206 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-27 08:28:50,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:28:50,415 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-27 08:28:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1943255998, now seen corresponding path program 9 times [2019-12-27 08:28:50,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:50,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390677852] [2019-12-27 08:28:50,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:50,885 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2019-12-27 08:28:51,604 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-12-27 08:28:51,845 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-27 08:28:51,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390677852] [2019-12-27 08:28:51,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912191578] [2019-12-27 08:28:51,845 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-27 08:28:51,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:28:51,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:28:51,923 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-27 08:28:51,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:28:51,957 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-27 08:28:51,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:28:51,981 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:28:51,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:51,987 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-27 08:28:51,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:51,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:51,997 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-27 08:28:51,998 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:28:52,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:28:52,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:52,432 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-27 08:28:52,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:52,489 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:28:52,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:28:52,490 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-27 08:28:52,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:52,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:28:52,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:28:52,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,750 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-27 08:28:52,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:52,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:28:52,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,786 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-27 08:28:52,787 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:52,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:28:52,799 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-27 08:28:52,800 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:52,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:52,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:28:52,824 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 08:28:53,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:53,073 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-27 08:28:53,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:53,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:53,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:28:53,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:39 [2019-12-27 08:28:53,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:53,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-27 08:28:53,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:28:53,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:28:53,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:28:53,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 08:28:53,267 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-27 08:28:53,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:28:53,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-27 08:28:53,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783487830] [2019-12-27 08:28:53,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 08:28:53,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 08:28:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 08:28:53,269 INFO L87 Difference]: Start difference. First operand 384 states and 862 transitions. Second operand 35 states. [2019-12-27 08:28:54,054 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 46 [2019-12-27 08:28:54,357 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 08:28:54,620 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-27 08:28:54,814 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-12-27 08:28:55,154 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-27 08:28:55,439 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 67 [2019-12-27 08:28:55,812 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-12-27 08:28:56,072 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-12-27 08:28:56,326 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 51 [2019-12-27 08:28:56,685 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-12-27 08:28:56,882 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-27 08:28:57,155 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 55 [2019-12-27 08:28:57,372 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2019-12-27 08:28:57,795 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 71 [2019-12-27 08:28:58,023 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2019-12-27 08:28:58,224 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-27 08:28:58,443 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 08:28:58,638 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-12-27 08:28:58,918 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 72 [2019-12-27 08:28:59,515 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2019-12-27 08:29:00,999 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-12-27 08:29:01,533 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-12-27 08:29:02,227 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-12-27 08:29:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:02,860 INFO L93 Difference]: Finished difference Result 617 states and 1383 transitions. [2019-12-27 08:29:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 08:29:02,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-27 08:29:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:02,866 INFO L225 Difference]: With dead ends: 617 [2019-12-27 08:29:02,866 INFO L226 Difference]: Without dead ends: 617 [2019-12-27 08:29:02,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1780 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1070, Invalid=5736, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 08:29:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-27 08:29:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 384. [2019-12-27 08:29:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 08:29:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 862 transitions. [2019-12-27 08:29:02,880 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 862 transitions. Word has length 23 [2019-12-27 08:29:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:02,883 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 862 transitions. [2019-12-27 08:29:02,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 08:29:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 862 transitions. [2019-12-27 08:29:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:29:02,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:02,885 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-27 08:29:03,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:03,089 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-27 08:29:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 439358334, now seen corresponding path program 10 times [2019-12-27 08:29:03,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:03,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587163125] [2019-12-27 08:29:03,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:03,461 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-12-27 08:29:03,712 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-12-27 08:29:03,976 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-12-27 08:29:04,547 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-27 08:29:04,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587163125] [2019-12-27 08:29:04,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35623595] [2019-12-27 08:29:04,548 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-27 08:29:04,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:29:04,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:29:04,612 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-27 08:29:04,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:29:04,625 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-27 08:29:04,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:04,649 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:29:04,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:04,656 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-27 08:29:04,656 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:04,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:04,666 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-27 08:29:04,667 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:29:05,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:05,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:05,135 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-27 08:29:05,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:05,189 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:29:05,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:05,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-27 08:29:05,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:05,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:05,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:05,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,427 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-27 08:29:05,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:05,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:05,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,456 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-27 08:29:05,457 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:05,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:05,470 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-27 08:29:05,471 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:05,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:05,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:05,490 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-27 08:29:05,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:05,833 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-27 08:29:05,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:05,900 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 08:29:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:05,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:05,901 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 08:29:06,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:06,032 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-27 08:29:06,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:06,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:06,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:29:06,038 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 08:29:06,120 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-27 08:29:06,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:29:06,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 08:29:06,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69910497] [2019-12-27 08:29:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 08:29:06,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 08:29:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:29:06,122 INFO L87 Difference]: Start difference. First operand 384 states and 862 transitions. Second operand 36 states. [2019-12-27 08:29:07,068 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2019-12-27 08:29:07,244 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-12-27 08:29:07,487 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2019-12-27 08:29:07,670 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2019-12-27 08:29:07,900 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2019-12-27 08:29:08,878 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-12-27 08:29:09,544 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-27 08:29:09,697 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-27 08:29:09,892 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-27 08:29:10,151 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-27 08:29:10,317 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-27 08:29:10,874 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62 [2019-12-27 08:29:11,074 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-12-27 08:29:11,633 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2019-12-27 08:29:11,830 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-27 08:29:12,200 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-12-27 08:29:12,430 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-12-27 08:29:12,906 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-12-27 08:29:13,490 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-27 08:29:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:14,159 INFO L93 Difference]: Finished difference Result 606 states and 1345 transitions. [2019-12-27 08:29:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:29:14,160 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 08:29:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:14,164 INFO L225 Difference]: With dead ends: 606 [2019-12-27 08:29:14,164 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 08:29:14,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 08:29:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 08:29:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 390. [2019-12-27 08:29:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-27 08:29:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 863 transitions. [2019-12-27 08:29:14,176 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 863 transitions. Word has length 23 [2019-12-27 08:29:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:14,176 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 863 transitions. [2019-12-27 08:29:14,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 08:29:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 863 transitions. [2019-12-27 08:29:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:29:14,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:14,177 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-27 08:29:14,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:14,381 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-27 08:29:14,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2146571010, now seen corresponding path program 11 times [2019-12-27 08:29:14,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:14,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814921706] [2019-12-27 08:29:14,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:15,358 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-27 08:29:15,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814921706] [2019-12-27 08:29:15,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63935578] [2019-12-27 08:29:15,358 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-27 08:29:15,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:29:15,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:29:15,426 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 103 conjunts are in the unsatisfiable core [2019-12-27 08:29:15,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:29:15,441 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-27 08:29:15,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:15,464 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-27 08:29:15,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:15,471 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-27 08:29:15,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:15,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:15,482 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-27 08:29:15,482 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:29:15,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:15,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:15,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:15,801 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-27 08:29:15,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:15,859 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:29:15,860 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-27 08:29:15,860 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-27 08:29:16,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:16,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:16,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:16,069 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-27 08:29:16,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:16,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:16,107 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-27 08:29:16,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:16,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:16,125 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-27 08:29:16,126 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:16,199 INFO L614 ElimStorePlain]: treesize reduction 135, result has 28.2 percent of original size [2019-12-27 08:29:16,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:16,200 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:245, output treesize:53 [2019-12-27 08:29:16,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:16,554 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 55 treesize of output 131 [2019-12-27 08:29:16,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:16,633 INFO L614 ElimStorePlain]: treesize reduction 56, result has 58.8 percent of original size [2019-12-27 08:29:16,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:16,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:16,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:16,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:55 [2019-12-27 08:29:16,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:16,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:17,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:17,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:17,164 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 49 treesize of output 48 [2019-12-27 08:29:17,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:17,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:17,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:29:17,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:7 [2019-12-27 08:29:17,260 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-27 08:29:17,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:29:17,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-27 08:29:17,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720248330] [2019-12-27 08:29:17,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 08:29:17,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 08:29:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 08:29:17,262 INFO L87 Difference]: Start difference. First operand 390 states and 863 transitions. Second operand 37 states. [2019-12-27 08:29:18,017 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 08:29:18,384 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-27 08:29:18,644 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-27 08:29:18,854 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-12-27 08:29:19,264 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-27 08:29:19,824 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-12-27 08:29:20,081 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-27 08:29:20,265 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-12-27 08:29:20,450 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-12-27 08:29:20,767 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-12-27 08:29:20,997 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-12-27 08:29:21,510 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2019-12-27 08:29:21,741 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-12-27 08:29:21,987 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-27 08:29:22,198 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 58 [2019-12-27 08:29:22,701 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 79 [2019-12-27 08:29:22,934 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-27 08:29:23,247 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 64 [2019-12-27 08:29:23,820 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-12-27 08:29:24,150 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-12-27 08:29:24,598 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 08:29:24,843 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-12-27 08:29:25,047 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-12-27 08:29:25,300 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-12-27 08:29:25,611 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2019-12-27 08:29:25,905 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 65 [2019-12-27 08:29:26,363 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-27 08:29:26,603 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-12-27 08:29:26,816 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2019-12-27 08:29:27,039 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-12-27 08:29:27,302 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 47 [2019-12-27 08:29:27,782 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2019-12-27 08:29:28,015 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-12-27 08:29:28,428 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-12-27 08:29:29,079 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2019-12-27 08:29:29,347 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-12-27 08:29:29,544 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2019-12-27 08:29:29,788 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2019-12-27 08:29:30,155 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 51 [2019-12-27 08:29:30,630 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2019-12-27 08:29:30,874 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2019-12-27 08:29:31,417 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 67 [2019-12-27 08:29:31,605 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-27 08:29:31,858 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 45 [2019-12-27 08:29:32,407 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2019-12-27 08:29:32,631 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 08:29:32,945 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-12-27 08:29:33,333 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-12-27 08:29:33,570 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-12-27 08:29:34,229 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 64 [2019-12-27 08:29:34,823 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-12-27 08:29:35,353 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 60 [2019-12-27 08:29:35,682 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-27 08:29:36,128 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-12-27 08:29:36,352 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-27 08:29:36,583 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-12-27 08:29:36,744 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-12-27 08:29:37,113 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-12-27 08:29:37,759 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-27 08:29:37,966 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-12-27 08:29:38,553 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-27 08:29:38,758 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-12-27 08:29:39,114 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-27 08:29:39,336 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 08:29:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:40,120 INFO L93 Difference]: Finished difference Result 646 states and 1418 transitions. [2019-12-27 08:29:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-12-27 08:29:40,120 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 23 [2019-12-27 08:29:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:40,124 INFO L225 Difference]: With dead ends: 646 [2019-12-27 08:29:40,125 INFO L226 Difference]: Without dead ends: 646 [2019-12-27 08:29:40,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6466 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=2128, Invalid=17612, Unknown=0, NotChecked=0, Total=19740 [2019-12-27 08:29:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-12-27 08:29:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 380. [2019-12-27 08:29:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-12-27 08:29:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 842 transitions. [2019-12-27 08:29:40,138 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 842 transitions. Word has length 23 [2019-12-27 08:29:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:40,138 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 842 transitions. [2019-12-27 08:29:40,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 08:29:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 842 transitions. [2019-12-27 08:29:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:29:40,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:40,139 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-27 08:29:40,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:40,343 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-27 08:29:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1522279140, now seen corresponding path program 12 times [2019-12-27 08:29:40,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:40,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870903205] [2019-12-27 08:29:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:40,795 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-12-27 08:29:41,321 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-27 08:29:41,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870903205] [2019-12-27 08:29:41,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392546943] [2019-12-27 08:29:41,322 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-27 08:29:41,385 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 08:29:41,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:29:41,387 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-27 08:29:41,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:29:41,399 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-27 08:29:41,400 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:41,424 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:29:41,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:41,434 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-27 08:29:41,434 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:41,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:41,446 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-27 08:29:41,446 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:29:41,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:41,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:41,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:41,843 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-27 08:29:41,844 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:41,903 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:29:41,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:41,904 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-27 08:29:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:42,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:42,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,077 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-27 08:29:42,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:42,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,116 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-27 08:29:42,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:42,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 69 treesize of output 56 [2019-12-27 08:29:42,129 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:42,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:42,160 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-27 08:29:42,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:42,389 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-27 08:29:42,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,448 INFO L614 ElimStorePlain]: treesize reduction 64, result has 47.5 percent of original size [2019-12-27 08:29:42,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:42,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:42,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:29 [2019-12-27 08:29:42,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:42,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:42,700 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-27 08:29:42,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:42,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:29:42,712 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 08:29:42,746 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-27 08:29:42,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:29:42,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-12-27 08:29:42,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259378638] [2019-12-27 08:29:42,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 08:29:42,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:42,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 08:29:42,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 08:29:42,748 INFO L87 Difference]: Start difference. First operand 380 states and 842 transitions. Second operand 34 states. [2019-12-27 08:29:43,657 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-27 08:29:43,878 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-12-27 08:29:44,059 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-27 08:29:44,287 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-12-27 08:29:45,084 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-12-27 08:29:45,366 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-27 08:29:45,718 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-12-27 08:29:45,882 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-27 08:29:46,269 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-12-27 08:29:46,466 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-12-27 08:29:46,877 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-12-27 08:29:47,400 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-12-27 08:29:47,620 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2019-12-27 08:29:47,906 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 08:29:48,117 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-27 08:29:48,310 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-27 08:29:48,826 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-12-27 08:29:49,371 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-27 08:29:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:50,005 INFO L93 Difference]: Finished difference Result 529 states and 1160 transitions. [2019-12-27 08:29:50,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:29:50,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 23 [2019-12-27 08:29:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:50,009 INFO L225 Difference]: With dead ends: 529 [2019-12-27 08:29:50,009 INFO L226 Difference]: Without dead ends: 529 [2019-12-27 08:29:50,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=673, Invalid=4297, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 08:29:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-27 08:29:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 382. [2019-12-27 08:29:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-27 08:29:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 846 transitions. [2019-12-27 08:29:50,020 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 846 transitions. Word has length 23 [2019-12-27 08:29:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:50,020 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 846 transitions. [2019-12-27 08:29:50,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 08:29:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 846 transitions. [2019-12-27 08:29:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:29:50,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:50,021 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-27 08:29:50,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:50,225 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-27 08:29:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1265695988, now seen corresponding path program 1 times [2019-12-27 08:29:50,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:50,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057880357] [2019-12-27 08:29:50,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:50,990 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-27 08:29:50,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057880357] [2019-12-27 08:29:50,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915862493] [2019-12-27 08:29:50,991 INFO L94 rtionOrderModulation]: Keeping assertion order 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-27 08:29:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:51,106 WARN L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-27 08:29:51,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:29:51,132 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-27 08:29:51,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,158 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:29:51,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,168 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-27 08:29:51,168 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:51,180 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-27 08:29:51,180 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:29:51,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:51,523 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-27 08:29:51,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,564 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 08:29:51,564 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-27 08:29:51,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:37 [2019-12-27 08:29:51,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:51,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:51,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,648 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-27 08:29:51,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,663 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-27 08:29:51,664 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,667 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-27 08:29:51,668 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:51,678 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-27 08:29:51,678 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:189, output treesize:29 [2019-12-27 08:29:51,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:51,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:51,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:51,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,836 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-27 08:29:51,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:51,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:51,858 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 52 treesize of output 42 [2019-12-27 08:29:51,859 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,863 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 64 treesize of output 50 [2019-12-27 08:29:51,864 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,880 INFO L614 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-12-27 08:29:51,881 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-27 08:29:51,881 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:189, output treesize:25 [2019-12-27 08:29:51,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:51,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:51,989 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 21 [2019-12-27 08:29:51,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:51,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:51,996 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 22 [2019-12-27 08:29:51,997 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:52,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:52,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:29:52,001 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:3 [2019-12-27 08:29:52,007 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-27 08:29:52,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:29:52,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-12-27 08:29:52,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475370850] [2019-12-27 08:29:52,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 08:29:52,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 08:29:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:29:52,009 INFO L87 Difference]: Start difference. First operand 382 states and 846 transitions. Second operand 30 states. [2019-12-27 08:29:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:54,916 INFO L93 Difference]: Finished difference Result 499 states and 1087 transitions. [2019-12-27 08:29:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:29:54,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-27 08:29:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:54,920 INFO L225 Difference]: With dead ends: 499 [2019-12-27 08:29:54,920 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 08:29:54,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=395, Invalid=2155, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 08:29:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 08:29:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 438. [2019-12-27 08:29:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 08:29:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 966 transitions. [2019-12-27 08:29:54,929 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 966 transitions. Word has length 25 [2019-12-27 08:29:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:54,929 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 966 transitions. [2019-12-27 08:29:54,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 08:29:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 966 transitions. [2019-12-27 08:29:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:29:54,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:54,931 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-27 08:29:55,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:55,134 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-27 08:29:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -850745206, now seen corresponding path program 13 times [2019-12-27 08:29:55,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:55,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040340079] [2019-12-27 08:29:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:55,710 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-12-27 08:29:56,739 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-27 08:29:56,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040340079] [2019-12-27 08:29:56,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022842926] [2019-12-27 08:29:56,739 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:29:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:56,810 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-27 08:29:56,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:29:56,826 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-27 08:29:56,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:29:56,851 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:29:56,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:56,868 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-27 08:29:56,868 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:56,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:56,878 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-27 08:29:56,879 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:29:57,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:29:57,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:57,439 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-27 08:29:57,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:57,497 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 08:29:57,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:57,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 08:29:57,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:57,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:57,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,697 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-27 08:29:57,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:57,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,723 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-27 08:29:57,724 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:57,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,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, 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-27 08:29:57,732 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:57,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:57,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:57,752 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 08:29:57,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:57,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:29:58,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:58,036 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-27 08:29:58,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,096 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 08:29:58,097 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:29:58,097 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 08:29:58,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:58,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:29:58,210 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-27 08:29:58,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,241 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-27 08:29:58,242 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,255 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-27 08:29:58,256 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,329 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 08:29:58,330 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-27 08:29:58,330 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 08:29:58,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:58,510 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-27 08:29:58,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:29:58,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:29:58,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 08:29:58,613 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-27 08:29:58,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:29:58,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-27 08:29:58,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540265010] [2019-12-27 08:29:58,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 08:29:58,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 08:29:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:29:58,614 INFO L87 Difference]: Start difference. First operand 438 states and 966 transitions. Second operand 39 states. [2019-12-27 08:29:59,596 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-12-27 08:29:59,864 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-27 08:30:00,123 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 54 [2019-12-27 08:30:00,974 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-27 08:30:01,407 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-12-27 08:30:01,706 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-12-27 08:30:02,067 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-27 08:30:02,354 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-12-27 08:30:02,750 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2019-12-27 08:30:02,953 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-27 08:30:03,290 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-12-27 08:30:03,668 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-12-27 08:30:03,888 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-12-27 08:30:04,302 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-12-27 08:30:04,795 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-12-27 08:30:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:05,426 INFO L93 Difference]: Finished difference Result 582 states and 1280 transitions. [2019-12-27 08:30:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 08:30:05,426 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-27 08:30:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:05,430 INFO L225 Difference]: With dead ends: 582 [2019-12-27 08:30:05,430 INFO L226 Difference]: Without dead ends: 582 [2019-12-27 08:30:05,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=530, Invalid=3630, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 08:30:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-27 08:30:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 441. [2019-12-27 08:30:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-27 08:30:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 972 transitions. [2019-12-27 08:30:05,438 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 972 transitions. Word has length 25 [2019-12-27 08:30:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:05,439 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 972 transitions. [2019-12-27 08:30:05,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 08:30:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 972 transitions. [2019-12-27 08:30:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:05,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:05,440 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-27 08:30:05,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:05,644 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-27 08:30:05,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash -51521140, now seen corresponding path program 2 times [2019-12-27 08:30:05,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:05,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166608595] [2019-12-27 08:30:05,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:06,394 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-27 08:30:06,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166608595] [2019-12-27 08:30:06,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037023826] [2019-12-27 08:30:06,396 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:06,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:30:06,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:06,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-27 08:30:06,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:06,476 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-27 08:30:06,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:30:06,510 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:30:06,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:06,515 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-27 08:30:06,516 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:06,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:06,528 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-27 08:30:06,528 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:30:06,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:06,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:06,836 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-27 08:30:06,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:06,878 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 08:30:06,879 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:06,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-27 08:30:06,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:06,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:06,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:06,983 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 52 treesize of output 42 [2019-12-27 08:30:06,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:06,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:06,999 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-27 08:30:06,999 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:07,004 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 64 treesize of output 50 [2019-12-27 08:30:07,004 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:07,015 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:07,016 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:07,016 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 08:30:07,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:07,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:07,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:07,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:07,169 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-27 08:30:07,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:07,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:07,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:07,189 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-27 08:30:07,190 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:07,193 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-27 08:30:07,194 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:07,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:07,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:07,203 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 08:30:07,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:07,293 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-27 08:30:07,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:30:07,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-12-27 08:30:07,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027509285] [2019-12-27 08:30:07,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 08:30:07,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 08:30:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:30:07,295 INFO L87 Difference]: Start difference. First operand 441 states and 972 transitions. Second operand 31 states. [2019-12-27 08:30:09,365 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 08:30:09,806 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 08:30:10,193 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 08:30:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:11,083 INFO L93 Difference]: Finished difference Result 529 states and 1150 transitions. [2019-12-27 08:30:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 08:30:11,084 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2019-12-27 08:30:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:11,087 INFO L225 Difference]: With dead ends: 529 [2019-12-27 08:30:11,087 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 08:30:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=518, Invalid=2562, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 08:30:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 08:30:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 450. [2019-12-27 08:30:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-27 08:30:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 990 transitions. [2019-12-27 08:30:11,096 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 990 transitions. Word has length 25 [2019-12-27 08:30:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:11,096 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 990 transitions. [2019-12-27 08:30:11,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 08:30:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 990 transitions. [2019-12-27 08:30:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:11,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:11,098 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-27 08:30:11,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:11,302 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-27 08:30:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1358732820, now seen corresponding path program 14 times [2019-12-27 08:30:11,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:11,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950370306] [2019-12-27 08:30:11,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:11,946 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-12-27 08:30:13,023 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-27 08:30:13,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950370306] [2019-12-27 08:30:13,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614129751] [2019-12-27 08:30:13,023 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:13,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:30:13,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:13,096 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 103 conjunts are in the unsatisfiable core [2019-12-27 08:30:13,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:13,115 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-27 08:30:13,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:30:13,138 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:30:13,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,142 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-27 08:30:13,143 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:13,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:13,154 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-27 08:30:13,154 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:30:13,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:13,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:13,570 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-27 08:30:13,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:13,637 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:30:13,638 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-27 08:30:13,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-27 08:30:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:13,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:13,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,806 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-27 08:30:13,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:13,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:13,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,853 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-27 08:30:13,853 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:13,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:13,885 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-27 08:30:13,886 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:13,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:13,933 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-27 08:30:13,933 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:260, output treesize:46 [2019-12-27 08:30:14,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:14,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:14,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:14,325 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:14,325 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-27 08:30:14,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,382 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 08:30:14,383 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-27 08:30:14,384 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 08:30:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:14,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:14,484 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 59 treesize of output 52 [2019-12-27 08:30:14,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:14,507 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 58 treesize of output 51 [2019-12-27 08:30:14,508 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,512 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 71 treesize of output 60 [2019-12-27 08:30:14,513 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:14,528 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-27 08:30:14,529 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:219, output treesize:39 [2019-12-27 08:30:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:14,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:14,779 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-27 08:30:14,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:14,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:30:14,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:7 [2019-12-27 08:30:14,815 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-27 08:30:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:30:14,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-12-27 08:30:14,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156269498] [2019-12-27 08:30:14,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 08:30:14,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 08:30:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 08:30:14,817 INFO L87 Difference]: Start difference. First operand 450 states and 990 transitions. Second operand 38 states. [2019-12-27 08:30:15,763 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-12-27 08:30:15,993 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-12-27 08:30:16,163 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-12-27 08:30:16,389 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-12-27 08:30:17,082 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-12-27 08:30:17,382 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-12-27 08:30:18,158 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-12-27 08:30:18,611 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-12-27 08:30:19,245 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-27 08:30:19,449 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-27 08:30:19,819 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-12-27 08:30:20,196 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-27 08:30:20,411 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-12-27 08:30:20,822 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 58 [2019-12-27 08:30:21,051 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2019-12-27 08:30:21,526 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-12-27 08:30:21,989 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2019-12-27 08:30:22,208 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-12-27 08:30:22,410 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-12-27 08:30:22,947 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 67 [2019-12-27 08:30:23,185 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 59 [2019-12-27 08:30:23,771 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 59 [2019-12-27 08:30:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:24,755 INFO L93 Difference]: Finished difference Result 740 states and 1622 transitions. [2019-12-27 08:30:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 08:30:24,756 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-27 08:30:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:24,760 INFO L225 Difference]: With dead ends: 740 [2019-12-27 08:30:24,760 INFO L226 Difference]: Without dead ends: 740 [2019-12-27 08:30:24,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=730, Invalid=5122, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 08:30:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-12-27 08:30:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 478. [2019-12-27 08:30:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-27 08:30:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1053 transitions. [2019-12-27 08:30:24,770 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1053 transitions. Word has length 25 [2019-12-27 08:30:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:24,770 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 1053 transitions. [2019-12-27 08:30:24,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 08:30:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1053 transitions. [2019-12-27 08:30:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:24,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:24,771 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-27 08:30:24,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:24,975 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-27 08:30:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1092700364, now seen corresponding path program 15 times [2019-12-27 08:30:24,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:24,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556272416] [2019-12-27 08:30:24,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:26,432 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-27 08:30:26,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556272416] [2019-12-27 08:30:26,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572846902] [2019-12-27 08:30:26,433 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:26,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:30:26,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:26,528 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-27 08:30:26,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:26,537 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-27 08:30:26,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:30:26,565 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:30:26,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:26,571 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-27 08:30:26,572 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:26,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:26,584 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-27 08:30:26,584 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:30:26,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:26,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:27,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:27,009 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-27 08:30:27,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,066 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:30:27,067 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-27 08:30:27,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-27 08:30:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:27,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:27,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,245 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-27 08:30:27,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,257 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:27,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,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, 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-27 08:30:27,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,287 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-27 08:30:27,288 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:27,307 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-27 08:30:27,307 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:260, output treesize:46 [2019-12-27 08:30:27,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:27,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:27,636 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-27 08:30:27,637 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,693 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 08:30:27,694 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-27 08:30:27,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 08:30:27,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:27,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:27,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:27,877 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 60 treesize of output 53 [2019-12-27 08:30:27,877 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:27,907 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-27 08:30:27,908 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:27,918 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-27 08:30:27,919 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:28,001 INFO L614 ElimStorePlain]: treesize reduction 127, result has 29.4 percent of original size [2019-12-27 08:30:28,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:28,002 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:53 [2019-12-27 08:30:28,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:28,097 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-27 08:30:28,098 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:28,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:28,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:30:28,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-27 08:30:28,190 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-27 08:30:28,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:30:28,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-27 08:30:28,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104578096] [2019-12-27 08:30:28,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 08:30:28,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 08:30:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:30:28,191 INFO L87 Difference]: Start difference. First operand 478 states and 1053 transitions. Second operand 39 states. [2019-12-27 08:30:29,208 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-27 08:30:29,628 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-12-27 08:30:30,043 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-12-27 08:30:31,126 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 08:30:31,629 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-27 08:30:32,049 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-12-27 08:30:32,713 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-12-27 08:30:33,059 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-27 08:30:33,244 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-12-27 08:30:33,522 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-27 08:30:33,814 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-27 08:30:33,996 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-27 08:30:34,401 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-27 08:30:34,687 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-27 08:30:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:35,812 INFO L93 Difference]: Finished difference Result 722 states and 1575 transitions. [2019-12-27 08:30:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 08:30:35,812 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-27 08:30:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:35,817 INFO L225 Difference]: With dead ends: 722 [2019-12-27 08:30:35,817 INFO L226 Difference]: Without dead ends: 722 [2019-12-27 08:30:35,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=701, Invalid=5151, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 08:30:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-27 08:30:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 510. [2019-12-27 08:30:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-12-27 08:30:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1127 transitions. [2019-12-27 08:30:35,826 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1127 transitions. Word has length 25 [2019-12-27 08:30:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:35,827 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 1127 transitions. [2019-12-27 08:30:35,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 08:30:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1127 transitions. [2019-12-27 08:30:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:35,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:35,828 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-27 08:30:36,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:36,032 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-27 08:30:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash -559508754, now seen corresponding path program 3 times [2019-12-27 08:30:36,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:36,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485702539] [2019-12-27 08:30:36,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:36,814 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-27 08:30:36,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485702539] [2019-12-27 08:30:36,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553452703] [2019-12-27 08:30:36,815 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-27 08:30:36,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:30:36,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:36,891 WARN L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 88 conjunts are in the unsatisfiable core [2019-12-27 08:30:36,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:36,900 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-27 08:30:36,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:36,918 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:30:36,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:36,925 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-27 08:30:36,925 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:36,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:36,936 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-27 08:30:36,937 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:30:37,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:37,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:37,181 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-27 08:30:37,182 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,223 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 08:30:37,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:37,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-27 08:30:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:37,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:37,320 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 52 treesize of output 42 [2019-12-27 08:30:37,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:37,339 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-27 08:30:37,340 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,344 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 64 treesize of output 50 [2019-12-27 08:30:37,345 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:37,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:37,354 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 08:30:37,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:37,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:37,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:37,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:37,682 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 52 treesize of output 42 [2019-12-27 08:30:37,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:37,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:37,702 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-27 08:30:37,702 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,708 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 64 treesize of output 50 [2019-12-27 08:30:37,709 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:37,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:37,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:37,724 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 08:30:38,033 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-27 08:30:38,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:30:38,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-12-27 08:30:38,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092308163] [2019-12-27 08:30:38,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 08:30:38,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 08:30:38,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:30:38,036 INFO L87 Difference]: Start difference. First operand 510 states and 1127 transitions. Second operand 31 states. [2019-12-27 08:30:38,609 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-27 08:30:39,089 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-12-27 08:30:39,325 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-27 08:30:39,516 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-12-27 08:30:39,690 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-27 08:30:39,888 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2019-12-27 08:30:40,119 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-12-27 08:30:40,303 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-12-27 08:30:40,487 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-12-27 08:30:40,861 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-27 08:30:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:42,296 INFO L93 Difference]: Finished difference Result 587 states and 1282 transitions. [2019-12-27 08:30:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:30:42,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2019-12-27 08:30:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:42,300 INFO L225 Difference]: With dead ends: 587 [2019-12-27 08:30:42,300 INFO L226 Difference]: Without dead ends: 570 [2019-12-27 08:30:42,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=391, Invalid=2159, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 08:30:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-27 08:30:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 490. [2019-12-27 08:30:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-27 08:30:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1082 transitions. [2019-12-27 08:30:42,309 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1082 transitions. Word has length 25 [2019-12-27 08:30:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:42,309 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1082 transitions. [2019-12-27 08:30:42,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 08:30:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1082 transitions. [2019-12-27 08:30:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:42,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:42,310 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-27 08:30:42,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:42,516 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-27 08:30:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 349231980, now seen corresponding path program 16 times [2019-12-27 08:30:42,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:42,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223889372] [2019-12-27 08:30:42,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:43,028 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2019-12-27 08:30:43,335 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 [2019-12-27 08:30:43,480 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-12-27 08:30:43,658 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-12-27 08:30:44,067 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2019-12-27 08:30:44,237 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 42 [2019-12-27 08:30:44,840 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-27 08:30:44,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223889372] [2019-12-27 08:30:44,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116054164] [2019-12-27 08:30:44,841 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-27 08:30:44,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:30:44,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:44,921 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-27 08:30:44,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:44,931 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-27 08:30:44,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:44,946 INFO L614 ElimStorePlain]: treesize reduction 13, result has 76.4 percent of original size [2019-12-27 08:30:44,958 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-27 08:30:44,958 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-27 08:30:44,958 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:44,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:44,966 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-27 08:30:44,967 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-27 08:30:45,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:45,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:45,412 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-27 08:30:45,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:45,466 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-27 08:30:45,467 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:45,467 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2019-12-27 08:30:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:45,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:45,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,686 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-27 08:30:45,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:45,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:45,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,716 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-27 08:30:45,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:45,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:45,727 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-27 08:30:45,728 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:45,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:45,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:45,743 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 08:30:46,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:46,103 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-27 08:30:46,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:46,153 INFO L614 ElimStorePlain]: treesize reduction 72, result has 43.3 percent of original size [2019-12-27 08:30:46,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:30:46,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:46 [2019-12-27 08:30:46,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:30:46,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,361 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-27 08:30:46,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:46,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,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, 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-27 08:30:46,398 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:46,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:46,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, 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-27 08:30:46,424 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:46,479 INFO L614 ElimStorePlain]: treesize reduction 123, result has 27.6 percent of original size [2019-12-27 08:30:46,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-27 08:30:46,480 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:227, output treesize:47 [2019-12-27 08:30:46,785 INFO L343 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2019-12-27 08:30:46,785 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-27 08:30:46,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:46,800 INFO L614 ElimStorePlain]: treesize reduction 16, result has 46.7 percent of original size [2019-12-27 08:30:46,800 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-27 08:30:46,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:7 [2019-12-27 08:30:46,854 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-27 08:30:46,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:30:46,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 38 [2019-12-27 08:30:46,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651893944] [2019-12-27 08:30:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 08:30:46,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 08:30:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1457, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 08:30:46,856 INFO L87 Difference]: Start difference. First operand 490 states and 1082 transitions. Second operand 40 states. [2019-12-27 08:30:48,293 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-27 08:30:48,560 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2019-12-27 08:30:48,781 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 [2019-12-27 08:30:49,090 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 67 [2019-12-27 08:30:49,923 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-12-27 08:30:50,874 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 82 [2019-12-27 08:30:51,083 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2019-12-27 08:30:51,557 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-27 08:30:51,975 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 67 [2019-12-27 08:30:52,207 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-12-27 08:30:52,433 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-12-27 08:30:52,909 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2019-12-27 08:30:53,560 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-27 08:30:53,805 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 53 [2019-12-27 08:30:54,371 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 89 [2019-12-27 08:30:54,866 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 87 [2019-12-27 08:30:55,147 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 70 [2019-12-27 08:30:55,757 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 92 [2019-12-27 08:30:56,320 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 08:30:56,639 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2019-12-27 08:30:56,964 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-27 08:30:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:57,904 INFO L93 Difference]: Finished difference Result 754 states and 1667 transitions. [2019-12-27 08:30:57,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:30:57,905 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 25 [2019-12-27 08:30:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:57,910 INFO L225 Difference]: With dead ends: 754 [2019-12-27 08:30:57,910 INFO L226 Difference]: Without dead ends: 754 [2019-12-27 08:30:57,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 08:30:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-12-27 08:30:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 550. [2019-12-27 08:30:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-27 08:30:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1225 transitions. [2019-12-27 08:30:57,918 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1225 transitions. Word has length 25 [2019-12-27 08:30:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:57,918 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1225 transitions. [2019-12-27 08:30:57,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 08:30:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1225 transitions. [2019-12-27 08:30:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:30:57,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:57,919 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-27 08:30:58,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:30:58,123 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-27 08:30:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1744368566, now seen corresponding path program 17 times [2019-12-27 08:30:58,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:58,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798400431] [2019-12-27 08:30:58,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:58,457 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-12-27 08:30:58,669 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-12-27 08:30:59,396 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-27 08:30:59,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798400431] [2019-12-27 08:30:59,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536746472] [2019-12-27 08:30:59,397 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-27 08:30:59,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:30:59,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:30:59,466 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-27 08:30:59,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:30:59,477 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-27 08:30:59,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:30:59,506 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:30:59,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:59,511 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-27 08:30:59,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:59,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:59,524 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-27 08:30:59,524 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:30:59,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:30:59,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:30:59,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:30:59,937 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-27 08:30:59,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:30:59,995 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 08:30:59,996 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-27 08:30:59,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-27 08:31:00,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:00,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:00,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:00,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,166 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-27 08:31:00,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:00,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,193 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-27 08:31:00,194 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,201 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-27 08:31:00,201 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:00,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-27 08:31:00,221 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:260, output treesize:46 [2019-12-27 08:31:00,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:00,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:00,455 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-27 08:31:00,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,509 INFO L614 ElimStorePlain]: treesize reduction 72, result has 43.3 percent of original size [2019-12-27 08:31:00,510 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-27 08:31:00,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:46 [2019-12-27 08:31:00,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:00,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:00,610 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-27 08:31:00,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,636 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-27 08:31:00,637 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,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, 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-27 08:31:00,647 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,706 INFO L614 ElimStorePlain]: treesize reduction 115, result has 27.2 percent of original size [2019-12-27 08:31:00,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:00,707 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:43 [2019-12-27 08:31:00,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:00,924 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-27 08:31:00,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:00,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:31:00,932 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-27 08:31:01,008 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-27 08:31:01,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:01,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-27 08:31:01,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578276364] [2019-12-27 08:31:01,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 08:31:01,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 08:31:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:01,010 INFO L87 Difference]: Start difference. First operand 550 states and 1225 transitions. Second operand 39 states. [2019-12-27 08:31:02,172 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-12-27 08:31:02,349 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-27 08:31:02,598 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-27 08:31:03,341 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-27 08:31:03,792 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-12-27 08:31:04,260 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-27 08:31:04,672 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-12-27 08:31:05,420 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-12-27 08:31:05,937 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-12-27 08:31:06,146 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-27 08:31:06,612 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-12-27 08:31:06,974 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-12-27 08:31:07,155 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-27 08:31:07,438 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-27 08:31:07,644 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-12-27 08:31:07,934 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-12-27 08:31:08,134 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-12-27 08:31:08,337 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-27 08:31:08,568 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-27 08:31:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:09,258 INFO L93 Difference]: Finished difference Result 799 states and 1782 transitions. [2019-12-27 08:31:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:31:09,259 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-27 08:31:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:09,264 INFO L225 Difference]: With dead ends: 799 [2019-12-27 08:31:09,264 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 08:31:09,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=829, Invalid=4871, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 08:31:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 08:31:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 481. [2019-12-27 08:31:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 08:31:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1057 transitions. [2019-12-27 08:31:09,274 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1057 transitions. Word has length 25 [2019-12-27 08:31:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:09,274 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1057 transitions. [2019-12-27 08:31:09,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 08:31:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1057 transitions. [2019-12-27 08:31:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:09,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:09,276 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-27 08:31:09,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:09,479 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-27 08:31:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1742250316, now seen corresponding path program 4 times [2019-12-27 08:31:09,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:09,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810522952] [2019-12-27 08:31:09,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:10,132 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-27 08:31:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810522952] [2019-12-27 08:31:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786163192] [2019-12-27 08:31:10,133 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-27 08:31:10,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:31:10,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:10,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-27 08:31:10,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:10,210 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-27 08:31:10,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:31:10,236 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-12-27 08:31:10,250 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-27 08:31:10,250 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-27 08:31:10,251 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:10,261 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-27 08:31:10,261 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-27 08:31:10,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:10,512 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-27 08:31:10,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,553 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.3 percent of original size [2019-12-27 08:31:10,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:10,554 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:34 [2019-12-27 08:31:10,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:10,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:10,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,662 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-27 08:31:10,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,680 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 59 treesize of output 43 [2019-12-27 08:31:10,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,685 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 60 treesize of output 44 [2019-12-27 08:31:10,685 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:10,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:10,696 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:28 [2019-12-27 08:31:10,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:10,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:10,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,877 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-27 08:31:10,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,899 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-27 08:31:10,900 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:10,905 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-27 08:31:10,906 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:10,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:10,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:10,916 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:28 [2019-12-27 08:31:10,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:11,005 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-27 08:31:11,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:11,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-12-27 08:31:11,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083506861] [2019-12-27 08:31:11,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 08:31:11,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 08:31:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:31:11,007 INFO L87 Difference]: Start difference. First operand 481 states and 1057 transitions. Second operand 29 states. [2019-12-27 08:31:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:14,489 INFO L93 Difference]: Finished difference Result 529 states and 1150 transitions. [2019-12-27 08:31:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:31:14,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-12-27 08:31:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:14,493 INFO L225 Difference]: With dead ends: 529 [2019-12-27 08:31:14,493 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 08:31:14,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=416, Invalid=2134, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 08:31:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 08:31:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 453. [2019-12-27 08:31:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-12-27 08:31:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 996 transitions. [2019-12-27 08:31:14,511 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 996 transitions. Word has length 25 [2019-12-27 08:31:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:14,512 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 996 transitions. [2019-12-27 08:31:14,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 08:31:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 996 transitions. [2019-12-27 08:31:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:14,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:14,513 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-27 08:31:14,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:14,725 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-27 08:31:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash -134526514, now seen corresponding path program 18 times [2019-12-27 08:31:14,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:14,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946897614] [2019-12-27 08:31:14,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:15,232 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-12-27 08:31:15,457 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-12-27 08:31:16,305 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-27 08:31:16,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946897614] [2019-12-27 08:31:16,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812309512] [2019-12-27 08:31:16,306 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-27 08:31:16,390 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 08:31:16,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:16,393 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 112 conjunts are in the unsatisfiable core [2019-12-27 08:31:16,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:16,402 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-27 08:31:16,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:31:16,430 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:31:16,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:16,442 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-27 08:31:16,442 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:16,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:16,452 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-27 08:31:16,452 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:31:16,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:16,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:16,801 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:16,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:16,830 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-27 08:31:16,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:16,891 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 08:31:16,892 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-27 08:31:16,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 08:31:17,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:17,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:17,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,090 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-27 08:31:17,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,117 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-27 08:31:17,118 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,127 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-27 08:31:17,128 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:17,148 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-27 08:31:17,148 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 08:31:17,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:17,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, 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-27 08:31:17,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,502 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 08:31:17,503 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-27 08:31:17,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 08:31:17,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:17,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,671 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 59 treesize of output 52 [2019-12-27 08:31:17,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:17,697 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 58 treesize of output 51 [2019-12-27 08:31:17,697 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,702 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 71 treesize of output 60 [2019-12-27 08:31:17,703 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:17,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:17,722 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-27 08:31:17,722 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:219, output treesize:39 [2019-12-27 08:31:18,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:18,267 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-27 08:31:18,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:18,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:18,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:31:18,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:7 [2019-12-27 08:31:18,322 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-27 08:31:18,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:18,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 38 [2019-12-27 08:31:18,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625242938] [2019-12-27 08:31:18,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 08:31:18,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 08:31:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 08:31:18,323 INFO L87 Difference]: Start difference. First operand 453 states and 996 transitions. Second operand 40 states. [2019-12-27 08:31:19,175 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-27 08:31:19,574 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-12-27 08:31:19,897 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2019-12-27 08:31:20,180 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 53 [2019-12-27 08:31:20,947 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-12-27 08:31:21,108 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-12-27 08:31:21,356 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-27 08:31:21,648 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-27 08:31:21,825 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-27 08:31:22,016 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-12-27 08:31:22,301 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 08:31:22,657 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2019-12-27 08:31:22,872 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-27 08:31:23,246 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-12-27 08:31:23,674 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-27 08:31:23,902 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-12-27 08:31:24,368 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-27 08:31:25,104 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-12-27 08:31:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:26,179 INFO L93 Difference]: Finished difference Result 590 states and 1295 transitions. [2019-12-27 08:31:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 08:31:26,179 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 25 [2019-12-27 08:31:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:26,183 INFO L225 Difference]: With dead ends: 590 [2019-12-27 08:31:26,183 INFO L226 Difference]: Without dead ends: 590 [2019-12-27 08:31:26,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=520, Invalid=4172, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 08:31:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-12-27 08:31:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 473. [2019-12-27 08:31:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 08:31:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1048 transitions. [2019-12-27 08:31:26,191 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1048 transitions. Word has length 25 [2019-12-27 08:31:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:26,192 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1048 transitions. [2019-12-27 08:31:26,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 08:31:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1048 transitions. [2019-12-27 08:31:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:26,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:26,193 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-27 08:31:26,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:26,397 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-27 08:31:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1818538862, now seen corresponding path program 19 times [2019-12-27 08:31:26,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:26,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050070068] [2019-12-27 08:31:26,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:26,972 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-12-27 08:31:27,221 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-12-27 08:31:27,989 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-27 08:31:27,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050070068] [2019-12-27 08:31:27,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32083389] [2019-12-27 08:31:27,990 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-27 08:31:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:28,062 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 94 conjunts are in the unsatisfiable core [2019-12-27 08:31:28,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:28,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,076 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-27 08:31:28,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, 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-27 08:31:28,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:28,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:28,087 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-27 08:31:28,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-27 08:31:28,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:28,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:28,364 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 57 treesize of output 84 [2019-12-27 08:31:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:31:28,465 INFO L614 ElimStorePlain]: treesize reduction 196, result has 28.2 percent of original size [2019-12-27 08:31:28,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:31:28,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:89 [2019-12-27 08:31:28,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:28,667 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 3 case distinctions, treesize of input 121 treesize of output 115 [2019-12-27 08:31:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,684 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:28,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:28,760 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 3 case distinctions, treesize of input 106 treesize of output 104 [2019-12-27 08:31:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,776 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:28,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:28,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:28,818 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 105 [2019-12-27 08:31:28,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:28,835 INFO L534 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:28,955 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 34 [2019-12-27 08:31:28,956 INFO L614 ElimStorePlain]: treesize reduction 684, result has 8.8 percent of original size [2019-12-27 08:31:28,956 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-27 08:31:28,957 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:371, output treesize:72 [2019-12-27 08:31:29,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:29,196 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 132 [2019-12-27 08:31:29,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:29,282 INFO L614 ElimStorePlain]: treesize reduction 125, result has 41.3 percent of original size [2019-12-27 08:31:29,283 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-27 08:31:29,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:72 [2019-12-27 08:31:29,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,380 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 70 treesize of output 52 [2019-12-27 08:31:29,381 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:29,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,404 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 72 treesize of output 54 [2019-12-27 08:31:29,405 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:29,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,421 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 70 treesize of output 52 [2019-12-27 08:31:29,421 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:29,504 INFO L614 ElimStorePlain]: treesize reduction 167, result has 29.2 percent of original size [2019-12-27 08:31:29,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:29,505 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:281, output treesize:69 [2019-12-27 08:31:29,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:29,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:29,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 58 [2019-12-27 08:31:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:29,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-27 08:31:29,746 INFO L614 ElimStorePlain]: treesize reduction 62, result has 28.7 percent of original size [2019-12-27 08:31:29,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:31:29,747 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:10 [2019-12-27 08:31:29,776 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-27 08:31:29,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:29,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 31 [2019-12-27 08:31:29,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465049826] [2019-12-27 08:31:29,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 08:31:29,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:29,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 08:31:29,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 08:31:29,777 INFO L87 Difference]: Start difference. First operand 473 states and 1048 transitions. Second operand 33 states. [2019-12-27 08:31:30,699 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-27 08:31:30,934 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-27 08:31:31,191 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2019-12-27 08:31:31,936 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-12-27 08:31:32,294 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-27 08:31:32,585 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-27 08:31:33,192 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-12-27 08:31:33,574 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-12-27 08:31:34,056 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-12-27 08:31:34,371 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-12-27 08:31:37,042 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-12-27 08:31:37,514 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-27 08:31:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:38,015 INFO L93 Difference]: Finished difference Result 567 states and 1255 transitions. [2019-12-27 08:31:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 08:31:38,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 25 [2019-12-27 08:31:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:38,020 INFO L225 Difference]: With dead ends: 567 [2019-12-27 08:31:38,020 INFO L226 Difference]: Without dead ends: 567 [2019-12-27 08:31:38,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=494, Invalid=2927, Unknown=1, NotChecked=0, Total=3422 [2019-12-27 08:31:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-12-27 08:31:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 463. [2019-12-27 08:31:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-12-27 08:31:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1026 transitions. [2019-12-27 08:31:38,026 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1026 transitions. Word has length 25 [2019-12-27 08:31:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:38,027 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 1026 transitions. [2019-12-27 08:31:38,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 08:31:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1026 transitions. [2019-12-27 08:31:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:38,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:38,027 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-27 08:31:38,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:38,229 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-27 08:31:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1019314796, now seen corresponding path program 5 times [2019-12-27 08:31:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:38,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375929749] [2019-12-27 08:31:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:38,915 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-27 08:31:38,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375929749] [2019-12-27 08:31:38,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667777940] [2019-12-27 08:31:38,915 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-27 08:31:38,992 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:38,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:38,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-27 08:31:38,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:39,004 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-27 08:31:39,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:31:39,036 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:31:39,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,041 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-27 08:31:39,041 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:39,053 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-27 08:31:39,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 08:31:39,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:39,317 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-27 08:31:39,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,367 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 08:31:39,368 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-27 08:31:39,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:37 [2019-12-27 08:31:39,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:39,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:39,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,435 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 52 treesize of output 42 [2019-12-27 08:31:39,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,450 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-27 08:31:39,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,454 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 51 treesize of output 41 [2019-12-27 08:31:39,454 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:39,466 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-27 08:31:39,466 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:189, output treesize:29 [2019-12-27 08:31:39,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:39,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:39,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,628 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 52 treesize of output 42 [2019-12-27 08:31:39,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:39,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:39,645 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-27 08:31:39,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,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, 2 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-27 08:31:39,649 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:39,669 INFO L614 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-12-27 08:31:39,669 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-27 08:31:39,669 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:189, output treesize:25 [2019-12-27 08:31:39,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:39,756 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-27 08:31:39,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:39,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-12-27 08:31:39,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781749740] [2019-12-27 08:31:39,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 08:31:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 08:31:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:31:39,758 INFO L87 Difference]: Start difference. First operand 463 states and 1026 transitions. Second operand 30 states. [2019-12-27 08:31:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:42,687 INFO L93 Difference]: Finished difference Result 531 states and 1164 transitions. [2019-12-27 08:31:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 08:31:42,688 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-27 08:31:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:42,691 INFO L225 Difference]: With dead ends: 531 [2019-12-27 08:31:42,691 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 08:31:42,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=346, Invalid=1910, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 08:31:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 08:31:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 411. [2019-12-27 08:31:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 08:31:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 917 transitions. [2019-12-27 08:31:42,698 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 917 transitions. Word has length 25 [2019-12-27 08:31:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:42,698 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 917 transitions. [2019-12-27 08:31:42,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 08:31:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 917 transitions. [2019-12-27 08:31:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:31:42,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:42,699 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-27 08:31:42,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:42,902 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-27 08:31:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1770531068, now seen corresponding path program 20 times [2019-12-27 08:31:42,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:42,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571436709] [2019-12-27 08:31:42,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:43,458 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-12-27 08:31:44,129 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-12-27 08:31:44,393 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-12-27 08:31:45,102 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-27 08:31:45,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571436709] [2019-12-27 08:31:45,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666536086] [2019-12-27 08:31:45,103 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-27 08:31:45,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:45,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:45,184 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 119 conjunts are in the unsatisfiable core [2019-12-27 08:31:45,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:45,193 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-27 08:31:45,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:45,217 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 08:31:45,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,222 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-27 08:31:45,222 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:45,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:45,233 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-27 08:31:45,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:31:45,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,636 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:45,663 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:45,663 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-27 08:31:45,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:45,727 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 08:31:45,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:45,728 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 08:31:45,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:45,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:45,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,924 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-27 08:31:45,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:45,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,970 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-27 08:31:45,971 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:45,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:45,979 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-27 08:31:45,980 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:46,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:46,018 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 08:31:46,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:31:46,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:46,297 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-27 08:31:46,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,372 INFO L614 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-12-27 08:31:46,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:46,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:55 [2019-12-27 08:31:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:31:46,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,508 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-27 08:31:46,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,544 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-27 08:31:46,545 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:31:46,568 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-27 08:31:46,569 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:46,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:46,588 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 08:31:46,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:46,859 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-27 08:31:46,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:46,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:46,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:31:46,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:39 [2019-12-27 08:31:47,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:47,248 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-27 08:31:47,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:31:47,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:31:47,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 08:31:47,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 08:31:47,288 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-27 08:31:47,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:47,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2019-12-27 08:31:47,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13922316] [2019-12-27 08:31:47,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-27 08:31:47,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-27 08:31:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 08:31:47,289 INFO L87 Difference]: Start difference. First operand 411 states and 917 transitions. Second operand 46 states. [2019-12-27 08:31:48,336 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 08:31:48,518 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-27 08:31:48,768 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-12-27 08:31:49,106 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-12-27 08:31:49,318 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-12-27 08:31:49,637 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-12-27 08:31:49,937 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 65 [2019-12-27 08:31:50,175 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2019-12-27 08:31:53,475 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-27 08:31:54,337 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 08:31:54,808 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-27 08:31:55,249 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-12-27 08:31:55,729 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-27 08:31:56,105 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-27 08:31:56,407 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-12-27 08:31:56,831 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-12-27 08:31:57,262 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-27 08:31:57,445 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-27 08:31:57,875 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-27 08:31:58,286 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-27 08:31:58,535 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-12-27 08:31:58,741 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 08:31:59,126 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-27 08:31:59,356 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-27 08:31:59,544 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-27 08:31:59,765 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-27 08:31:59,993 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-27 08:32:00,464 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-12-27 08:32:00,829 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-12-27 08:32:01,104 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-27 08:32:01,543 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-27 08:32:01,799 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-27 08:32:02,075 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-27 08:32:02,432 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 08:32:02,839 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-12-27 08:32:03,081 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-12-27 08:32:03,307 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-27 08:32:03,731 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-12-27 08:32:04,066 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-12-27 08:32:04,222 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-12-27 08:32:04,607 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 08:32:05,307 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-27 08:32:05,682 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 08:32:05,870 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-12-27 08:32:06,340 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-27 08:32:06,546 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-27 08:32:06,987 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-12-27 08:32:07,664 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-12-27 08:32:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:08,173 INFO L93 Difference]: Finished difference Result 696 states and 1527 transitions. [2019-12-27 08:32:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-27 08:32:08,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-12-27 08:32:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:08,176 INFO L225 Difference]: With dead ends: 696 [2019-12-27 08:32:08,176 INFO L226 Difference]: Without dead ends: 696 [2019-12-27 08:32:08,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7330 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=2367, Invalid=19095, Unknown=0, NotChecked=0, Total=21462 [2019-12-27 08:32:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-27 08:32:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 552. [2019-12-27 08:32:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-12-27 08:32:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1236 transitions. [2019-12-27 08:32:08,186 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1236 transitions. Word has length 30 [2019-12-27 08:32:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:08,186 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 1236 transitions. [2019-12-27 08:32:08,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-27 08:32:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1236 transitions. [2019-12-27 08:32:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:32:08,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:08,187 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-27 08:32:08,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:08,391 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-27 08:32:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1237545890, now seen corresponding path program 6 times [2019-12-27 08:32:08,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:08,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684723493] [2019-12-27 08:32:08,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:09,055 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-12-27 08:32:09,802 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-27 08:32:09,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684723493] [2019-12-27 08:32:09,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435786588] [2019-12-27 08:32:09,803 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-27 08:32:09,892 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 08:32:09,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:09,895 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 126 conjunts are in the unsatisfiable core [2019-12-27 08:32:09,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:09,906 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-27 08:32:09,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 08:32:09,935 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 08:32:09,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:09,938 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-27 08:32:09,939 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:32:09,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:32:09,951 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-27 08:32:09,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 08:32:10,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:32:10,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:32:10,353 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-27 08:32:10,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:32:10,418 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 08:32:10,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:32:10,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 08:32:10,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:32:10,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:32:10,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:32:10,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,563 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-27 08:32:10,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 08:32:10,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 08:32:10,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,587 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-27 08:32:10,587 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 08:32:10,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 08:32:10,594 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-27 08:32:10,595 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 08:32:10,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:32:10,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-27 08:32:10,615 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 Received shutdown request... [2019-12-27 08:32:10,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:10,958 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 08:32:10,963 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 08:32:10,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:32:10 BasicIcfg [2019-12-27 08:32:10,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:32:10,964 INFO L168 Benchmark]: Toolchain (without parser) took 249275.26 ms. Allocated memory was 140.0 MB in the beginning and 255.3 MB in the end (delta: 115.3 MB). Free memory was 103.6 MB in the beginning and 95.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,965 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.81 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 150.8 MB in the end (delta: -47.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.10 ms. Allocated memory is still 204.5 MB. Free memory was 150.8 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,966 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 204.5 MB. Free memory was 148.2 MB in the beginning and 146.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,966 INFO L168 Benchmark]: RCFGBuilder took 542.82 ms. Allocated memory is still 204.5 MB. Free memory was 146.1 MB in the beginning and 116.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,966 INFO L168 Benchmark]: TraceAbstraction took 247875.73 ms. Allocated memory was 204.5 MB in the beginning and 255.3 MB in the end (delta: 50.9 MB). Free memory was 115.9 MB in the beginning and 95.7 MB in the end (delta: 20.1 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:10,967 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.49 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.81 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 150.8 MB in the end (delta: -47.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.10 ms. Allocated memory is still 204.5 MB. Free memory was 150.8 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.39 ms. Allocated memory is still 204.5 MB. Free memory was 148.2 MB in the beginning and 146.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 542.82 ms. Allocated memory is still 204.5 MB. Free memory was 146.1 MB in the beginning and 116.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247875.73 ms. Allocated memory was 204.5 MB in the beginning and 255.3 MB in the end (delta: 50.9 MB). Free memory was 115.9 MB in the beginning and 95.7 MB in the end (delta: 20.1 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 2658 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5914 CheckedPairsTotal, 112 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 32 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 32 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 247.7s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 175.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 950 SDtfs, 5785 SDslu, 6564 SDs, 0 SdLazy, 51125 SolverSat, 1985 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1858 GetRequests, 187 SyntacticMatches, 51 SemanticMatches, 1620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32005 ImplicationChecksByTransitivity, 155.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 3554 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 59.0s InterpolantComputationTime, 1171 NumberOfCodeBlocks, 1171 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1118 ConstructedInterpolants, 393 QuantifiedInterpolants, 1012058 SizeOfPredicates, 801 NumberOfNonLiveVariables, 3138 ConjunctsInSsa, 1837 ConjunctsInUnsatCore, 53 InterpolantComputations, 13 PerfectInterpolantSequences, 30/266 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