/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:25:40,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:25:40,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:25:40,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:25:40,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:25:40,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:25:40,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:25:40,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:25:40,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:25:40,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:25:40,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:25:40,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:25:40,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:25:40,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:25:40,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:25:40,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:25:40,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:25:40,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:25:40,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:25:40,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:25:40,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:25:40,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:25:40,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:25:40,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:25:40,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:25:40,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:25:40,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:25:40,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:25:40,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:25:40,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:25:40,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:25:40,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:25:40,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:25:40,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:25:40,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:25:40,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:25:40,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:25:40,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:25:40,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:25:40,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:25:40,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:25:40,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:25:40,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:25:40,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:25:40,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:25:40,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:25:40,647 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:25:40,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:25:40,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:25:40,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:25:40,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:25:40,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:25:40,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:25:40,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:25:40,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:25:40,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:25:40,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:25:40,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:25:40,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:25:40,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:25:40,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:25:40,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:25:40,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:25:40,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:25:40,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:25:40,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:25:40,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:25:40,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:25:40,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:25:40,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:25:40,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:25:40,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 19:25:41,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de48760f/465449604bc84191893e7a7dd6976778/FLAG39d87ba87 [2019-12-18 19:25:41,675 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:25:41,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 19:25:41,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de48760f/465449604bc84191893e7a7dd6976778/FLAG39d87ba87 [2019-12-18 19:25:41,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de48760f/465449604bc84191893e7a7dd6976778 [2019-12-18 19:25:41,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:25:41,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:25:41,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:41,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:25:41,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:25:41,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:41" (1/1) ... [2019-12-18 19:25:41,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2208db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:41, skipping insertion in model container [2019-12-18 19:25:41,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:41" (1/1) ... [2019-12-18 19:25:41,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:25:41,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:25:42,171 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:42,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:42,579 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:25:42,593 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:42,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:42,834 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:25:42,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42 WrapperNode [2019-12-18 19:25:42,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:42,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:42,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:25:42,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:25:42,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:42,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:25:42,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:25:42,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:25:42,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... [2019-12-18 19:25:42,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:25:42,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:25:42,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:25:42,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:25:42,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:25:43,018 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 19:25:43,019 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 19:25:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 19:25:43,019 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 19:25:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:25:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:25:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:25:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:25:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 19:25:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 19:25:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:25:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:25:43,023 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:25:43,700 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:25:43,700 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 19:25:43,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:43 BoogieIcfgContainer [2019-12-18 19:25:43,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:25:43,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:25:43,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:25:43,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:25:43,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:25:41" (1/3) ... [2019-12-18 19:25:43,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6767e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:43, skipping insertion in model container [2019-12-18 19:25:43,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:42" (2/3) ... [2019-12-18 19:25:43,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6767e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:43, skipping insertion in model container [2019-12-18 19:25:43,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:43" (3/3) ... [2019-12-18 19:25:43,710 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2019-12-18 19:25:43,721 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:25:43,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:25:43,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 19:25:43,731 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:25:43,776 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,777 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,777 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,777 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,778 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,778 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,778 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,778 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,778 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,779 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,779 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,779 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,779 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,779 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,780 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,780 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,780 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,780 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,780 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,781 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,781 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,781 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,781 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,781 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,782 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,782 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,782 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,782 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,782 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,783 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,784 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,785 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,786 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,786 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,786 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,786 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,786 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,787 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,787 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,787 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,787 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,787 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,788 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,788 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,788 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,788 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,788 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,789 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,789 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,790 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,790 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,791 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,791 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,791 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,792 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,792 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,793 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,793 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,793 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,793 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,793 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,794 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,794 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,794 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,794 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,795 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,796 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,796 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,796 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,797 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,797 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,798 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,798 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,798 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,798 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,799 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,799 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,799 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,799 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,800 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,800 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,800 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,800 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,800 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,801 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,801 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,802 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,804 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,804 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,804 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,804 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,805 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,809 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,809 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,809 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,810 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,817 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,818 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,818 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,818 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,818 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,819 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,820 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,820 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,820 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,820 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,821 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,823 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,823 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,823 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,823 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,823 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,825 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,825 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,827 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,828 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,828 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,828 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,828 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,832 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,832 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,834 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,834 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,834 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,834 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,835 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,836 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,836 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,836 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,836 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,837 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,837 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,837 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,838 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,838 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,838 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,838 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,838 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,839 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,840 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,841 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,842 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,843 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,843 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,843 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,843 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,843 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,844 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,845 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,845 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,845 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,846 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,846 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,846 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,846 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,846 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,847 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,848 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,848 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,848 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,848 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,848 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,849 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,849 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,853 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,853 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,853 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,854 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,854 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,854 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,854 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,861 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,861 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,862 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,865 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,865 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,865 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,865 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,865 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,868 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,868 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,869 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,869 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,869 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,869 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,869 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,871 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,872 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,872 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,872 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,872 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,872 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,873 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,873 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,873 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,873 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,874 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,874 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,874 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,880 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,881 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,881 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,882 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,882 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,882 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,882 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,882 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,883 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,884 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,884 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,884 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,884 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,884 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:43,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 19:25:43,929 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:25:43,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:25:43,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:25:43,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:25:43,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:25:43,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:25:43,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:25:43,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:25:43,950 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions [2019-12-18 19:25:43,951 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 19:25:44,090 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 19:25:44,090 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:44,112 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 19:25:44,136 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 19:25:44,224 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 19:25:44,224 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:44,232 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 19:25:44,253 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2019-12-18 19:25:44,255 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:25:46,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:47,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:48,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:48,846 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-12-18 19:25:49,314 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-18 19:25:49,454 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-18 19:25:49,621 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27423 [2019-12-18 19:25:49,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-18 19:25:49,625 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 65 transitions [2019-12-18 19:25:49,735 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2019-12-18 19:25:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2019-12-18 19:25:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:25:49,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:49,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:49,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 244665820, now seen corresponding path program 1 times [2019-12-18 19:25:49,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:49,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705470140] [2019-12-18 19:25:49,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:50,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705470140] [2019-12-18 19:25:50,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:50,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:25:50,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902452449] [2019-12-18 19:25:50,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:25:50,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:25:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:25:50,217 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2019-12-18 19:25:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:50,647 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2019-12-18 19:25:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:25:50,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 19:25:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:50,700 INFO L225 Difference]: With dead ends: 2543 [2019-12-18 19:25:50,701 INFO L226 Difference]: Without dead ends: 2405 [2019-12-18 19:25:50,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:25:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-12-18 19:25:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2019-12-18 19:25:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-12-18 19:25:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2019-12-18 19:25:50,890 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2019-12-18 19:25:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:50,890 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2019-12-18 19:25:50,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:25:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2019-12-18 19:25:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:50,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:50,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:50,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1321724129, now seen corresponding path program 1 times [2019-12-18 19:25:50,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:50,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168680802] [2019-12-18 19:25:50,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:51,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168680802] [2019-12-18 19:25:51,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:51,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:25:51,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134192370] [2019-12-18 19:25:51,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:25:51,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:25:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:25:51,169 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2019-12-18 19:25:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:51,749 INFO L93 Difference]: Finished difference Result 2942 states and 9516 transitions. [2019-12-18 19:25:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:25:51,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 19:25:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:51,772 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 19:25:51,772 INFO L226 Difference]: Without dead ends: 2898 [2019-12-18 19:25:51,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:25:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-12-18 19:25:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2019-12-18 19:25:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-18 19:25:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2019-12-18 19:25:51,877 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2019-12-18 19:25:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:51,878 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2019-12-18 19:25:51,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:25:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2019-12-18 19:25:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:51,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:51,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:51,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash 456238224, now seen corresponding path program 1 times [2019-12-18 19:25:51,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:51,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124902606] [2019-12-18 19:25:51,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:52,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124902606] [2019-12-18 19:25:52,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:52,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:25:52,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969307990] [2019-12-18 19:25:52,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:25:52,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:25:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:25:52,627 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 13 states. [2019-12-18 19:25:53,658 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-18 19:25:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:54,410 INFO L93 Difference]: Finished difference Result 3440 states and 11205 transitions. [2019-12-18 19:25:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:25:54,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:25:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:54,436 INFO L225 Difference]: With dead ends: 3440 [2019-12-18 19:25:54,436 INFO L226 Difference]: Without dead ends: 3440 [2019-12-18 19:25:54,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:25:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2019-12-18 19:25:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3017. [2019-12-18 19:25:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2019-12-18 19:25:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 9857 transitions. [2019-12-18 19:25:54,534 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 9857 transitions. Word has length 25 [2019-12-18 19:25:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:54,536 INFO L462 AbstractCegarLoop]: Abstraction has 3017 states and 9857 transitions. [2019-12-18 19:25:54,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:25:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 9857 transitions. [2019-12-18 19:25:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:54,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:54,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:54,542 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -556454308, now seen corresponding path program 2 times [2019-12-18 19:25:54,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:54,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635568196] [2019-12-18 19:25:54,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:54,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635568196] [2019-12-18 19:25:54,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:54,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:25:54,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911102991] [2019-12-18 19:25:54,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:25:54,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:54,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:25:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:25:54,993 INFO L87 Difference]: Start difference. First operand 3017 states and 9857 transitions. Second operand 13 states. [2019-12-18 19:25:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:56,859 INFO L93 Difference]: Finished difference Result 3462 states and 11280 transitions. [2019-12-18 19:25:56,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:25:56,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:25:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:56,883 INFO L225 Difference]: With dead ends: 3462 [2019-12-18 19:25:56,883 INFO L226 Difference]: Without dead ends: 3462 [2019-12-18 19:25:56,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:25:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2019-12-18 19:25:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3234. [2019-12-18 19:25:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-12-18 19:25:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 10616 transitions. [2019-12-18 19:25:57,032 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 10616 transitions. Word has length 25 [2019-12-18 19:25:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:57,033 INFO L462 AbstractCegarLoop]: Abstraction has 3234 states and 10616 transitions. [2019-12-18 19:25:57,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:25:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 10616 transitions. [2019-12-18 19:25:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:57,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:57,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:57,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash -389201428, now seen corresponding path program 3 times [2019-12-18 19:25:57,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:57,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330677765] [2019-12-18 19:25:57,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330677765] [2019-12-18 19:25:57,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:57,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:25:57,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195010906] [2019-12-18 19:25:57,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:25:57,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:25:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:25:57,563 INFO L87 Difference]: Start difference. First operand 3234 states and 10616 transitions. Second operand 13 states. [2019-12-18 19:25:58,740 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-18 19:25:59,083 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-18 19:25:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:59,266 INFO L93 Difference]: Finished difference Result 3504 states and 11329 transitions. [2019-12-18 19:25:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:25:59,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:25:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:59,289 INFO L225 Difference]: With dead ends: 3504 [2019-12-18 19:25:59,289 INFO L226 Difference]: Without dead ends: 3504 [2019-12-18 19:25:59,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:25:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2019-12-18 19:25:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3388. [2019-12-18 19:25:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-12-18 19:25:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2019-12-18 19:25:59,378 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2019-12-18 19:25:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:59,378 INFO L462 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2019-12-18 19:25:59,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:25:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2019-12-18 19:25:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:59,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:59,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:59,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:25:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash -624413205, now seen corresponding path program 1 times [2019-12-18 19:25:59,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:59,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229906712] [2019-12-18 19:25:59,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:59,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229906712] [2019-12-18 19:25:59,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:59,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:25:59,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538355007] [2019-12-18 19:25:59,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:25:59,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:25:59,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:25:59,844 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 14 states. [2019-12-18 19:26:00,659 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-18 19:26:01,403 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-12-18 19:26:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:01,805 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2019-12-18 19:26:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:26:01,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:01,820 INFO L225 Difference]: With dead ends: 4020 [2019-12-18 19:26:01,820 INFO L226 Difference]: Without dead ends: 4020 [2019-12-18 19:26:01,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:26:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2019-12-18 19:26:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2019-12-18 19:26:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-18 19:26:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2019-12-18 19:26:01,916 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2019-12-18 19:26:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:01,917 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2019-12-18 19:26:01,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2019-12-18 19:26:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:01,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:01,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:01,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash 106947557, now seen corresponding path program 2 times [2019-12-18 19:26:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:01,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947552236] [2019-12-18 19:26:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:02,556 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 19:26:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:02,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947552236] [2019-12-18 19:26:02,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:02,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968160640] [2019-12-18 19:26:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:02,585 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 14 states. [2019-12-18 19:26:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:04,745 INFO L93 Difference]: Finished difference Result 4056 states and 13114 transitions. [2019-12-18 19:26:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:26:04,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:04,758 INFO L225 Difference]: With dead ends: 4056 [2019-12-18 19:26:04,758 INFO L226 Difference]: Without dead ends: 4056 [2019-12-18 19:26:04,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:26:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-18 19:26:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3584. [2019-12-18 19:26:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 19:26:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11673 transitions. [2019-12-18 19:26:04,954 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11673 transitions. Word has length 25 [2019-12-18 19:26:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:04,955 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 11673 transitions. [2019-12-18 19:26:04,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11673 transitions. [2019-12-18 19:26:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:04,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:04,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:04,967 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2012965443, now seen corresponding path program 3 times [2019-12-18 19:26:04,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:04,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564402119] [2019-12-18 19:26:04,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:05,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564402119] [2019-12-18 19:26:05,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:05,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:05,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308434371] [2019-12-18 19:26:05,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:05,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:05,410 INFO L87 Difference]: Start difference. First operand 3584 states and 11673 transitions. Second operand 14 states. [2019-12-18 19:26:06,900 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-18 19:26:07,194 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-18 19:26:07,517 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-18 19:26:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:07,844 INFO L93 Difference]: Finished difference Result 4022 states and 12928 transitions. [2019-12-18 19:26:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:07,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:07,856 INFO L225 Difference]: With dead ends: 4022 [2019-12-18 19:26:07,856 INFO L226 Difference]: Without dead ends: 4022 [2019-12-18 19:26:07,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2019-12-18 19:26:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3794. [2019-12-18 19:26:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-12-18 19:26:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 12303 transitions. [2019-12-18 19:26:07,951 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 12303 transitions. Word has length 25 [2019-12-18 19:26:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:07,951 INFO L462 AbstractCegarLoop]: Abstraction has 3794 states and 12303 transitions. [2019-12-18 19:26:07,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 12303 transitions. [2019-12-18 19:26:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:07,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:07,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:07,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:07,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:07,959 INFO L82 PathProgramCache]: Analyzing trace with hash 84923173, now seen corresponding path program 4 times [2019-12-18 19:26:07,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:07,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614662533] [2019-12-18 19:26:07,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:08,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614662533] [2019-12-18 19:26:08,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:08,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:08,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607196375] [2019-12-18 19:26:08,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:08,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:08,454 INFO L87 Difference]: Start difference. First operand 3794 states and 12303 transitions. Second operand 14 states. [2019-12-18 19:26:09,944 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 19:26:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:10,975 INFO L93 Difference]: Finished difference Result 3994 states and 12844 transitions. [2019-12-18 19:26:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:10,975 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:10,985 INFO L225 Difference]: With dead ends: 3994 [2019-12-18 19:26:10,986 INFO L226 Difference]: Without dead ends: 3994 [2019-12-18 19:26:10,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-12-18 19:26:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3865. [2019-12-18 19:26:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3865 states. [2019-12-18 19:26:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 12515 transitions. [2019-12-18 19:26:11,077 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 12515 transitions. Word has length 25 [2019-12-18 19:26:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:11,077 INFO L462 AbstractCegarLoop]: Abstraction has 3865 states and 12515 transitions. [2019-12-18 19:26:11,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 12515 transitions. [2019-12-18 19:26:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:11,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:11,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:11,086 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:11,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash 958663853, now seen corresponding path program 5 times [2019-12-18 19:26:11,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:11,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103247000] [2019-12-18 19:26:11,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:11,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103247000] [2019-12-18 19:26:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:11,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:11,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594743992] [2019-12-18 19:26:11,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:11,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:11,537 INFO L87 Difference]: Start difference. First operand 3865 states and 12515 transitions. Second operand 13 states. [2019-12-18 19:26:12,384 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-18 19:26:13,264 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-18 19:26:13,513 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-12-18 19:26:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:13,770 INFO L93 Difference]: Finished difference Result 4065 states and 13075 transitions. [2019-12-18 19:26:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:26:13,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:13,778 INFO L225 Difference]: With dead ends: 4065 [2019-12-18 19:26:13,779 INFO L226 Difference]: Without dead ends: 4065 [2019-12-18 19:26:13,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:26:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2019-12-18 19:26:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3948. [2019-12-18 19:26:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 19:26:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2019-12-18 19:26:13,869 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2019-12-18 19:26:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:13,869 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2019-12-18 19:26:13,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2019-12-18 19:26:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:13,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:13,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:13,878 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1770005220, now seen corresponding path program 4 times [2019-12-18 19:26:13,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:13,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170597870] [2019-12-18 19:26:13,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:14,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170597870] [2019-12-18 19:26:14,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:14,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:14,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74085341] [2019-12-18 19:26:14,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:14,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:14,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:14,315 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2019-12-18 19:26:15,264 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-18 19:26:15,525 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-12-18 19:26:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:15,878 INFO L93 Difference]: Finished difference Result 4050 states and 13039 transitions. [2019-12-18 19:26:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:26:15,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:15,888 INFO L225 Difference]: With dead ends: 4050 [2019-12-18 19:26:15,888 INFO L226 Difference]: Without dead ends: 4050 [2019-12-18 19:26:15,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:26:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2019-12-18 19:26:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3990. [2019-12-18 19:26:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-12-18 19:26:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 12909 transitions. [2019-12-18 19:26:15,968 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 12909 transitions. Word has length 25 [2019-12-18 19:26:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:15,969 INFO L462 AbstractCegarLoop]: Abstraction has 3990 states and 12909 transitions. [2019-12-18 19:26:15,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 12909 transitions. [2019-12-18 19:26:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:15,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:15,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:15,977 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash 757312688, now seen corresponding path program 5 times [2019-12-18 19:26:15,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:15,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342252798] [2019-12-18 19:26:15,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:16,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342252798] [2019-12-18 19:26:16,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:16,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:16,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038597683] [2019-12-18 19:26:16,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:16,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:16,468 INFO L87 Difference]: Start difference. First operand 3990 states and 12909 transitions. Second operand 13 states. [2019-12-18 19:26:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:18,421 INFO L93 Difference]: Finished difference Result 4358 states and 14077 transitions. [2019-12-18 19:26:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:26:18,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:18,428 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 19:26:18,428 INFO L226 Difference]: Without dead ends: 4358 [2019-12-18 19:26:18,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:26:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2019-12-18 19:26:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 4186. [2019-12-18 19:26:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-12-18 19:26:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 13595 transitions. [2019-12-18 19:26:18,565 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 13595 transitions. Word has length 25 [2019-12-18 19:26:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:18,565 INFO L462 AbstractCegarLoop]: Abstraction has 4186 states and 13595 transitions. [2019-12-18 19:26:18,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 13595 transitions. [2019-12-18 19:26:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:18,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:18,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:18,574 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 924565568, now seen corresponding path program 6 times [2019-12-18 19:26:18,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:18,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347811019] [2019-12-18 19:26:18,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:18,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347811019] [2019-12-18 19:26:18,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:18,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:26:18,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031324108] [2019-12-18 19:26:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:26:18,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:26:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:26:18,946 INFO L87 Difference]: Start difference. First operand 4186 states and 13595 transitions. Second operand 12 states. [2019-12-18 19:26:21,054 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-18 19:26:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:21,403 INFO L93 Difference]: Finished difference Result 4946 states and 15775 transitions. [2019-12-18 19:26:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:21,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 19:26:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:21,411 INFO L225 Difference]: With dead ends: 4946 [2019-12-18 19:26:21,411 INFO L226 Difference]: Without dead ends: 4946 [2019-12-18 19:26:21,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:26:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2019-12-18 19:26:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 3878. [2019-12-18 19:26:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2019-12-18 19:26:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 12497 transitions. [2019-12-18 19:26:21,508 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 12497 transitions. Word has length 25 [2019-12-18 19:26:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:21,508 INFO L462 AbstractCegarLoop]: Abstraction has 3878 states and 12497 transitions. [2019-12-18 19:26:21,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:26:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 12497 transitions. [2019-12-18 19:26:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:21,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:21,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:21,518 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash -908781430, now seen corresponding path program 7 times [2019-12-18 19:26:21,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:21,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019988748] [2019-12-18 19:26:21,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:22,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019988748] [2019-12-18 19:26:22,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:22,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:22,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372593977] [2019-12-18 19:26:22,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:22,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:22,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:22,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:22,038 INFO L87 Difference]: Start difference. First operand 3878 states and 12497 transitions. Second operand 13 states. [2019-12-18 19:26:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:23,484 INFO L93 Difference]: Finished difference Result 3906 states and 12585 transitions. [2019-12-18 19:26:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:26:23,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:23,490 INFO L225 Difference]: With dead ends: 3906 [2019-12-18 19:26:23,490 INFO L226 Difference]: Without dead ends: 3906 [2019-12-18 19:26:23,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:26:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-12-18 19:26:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3906. [2019-12-18 19:26:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-12-18 19:26:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 12585 transitions. [2019-12-18 19:26:23,563 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 12585 transitions. Word has length 25 [2019-12-18 19:26:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:23,564 INFO L462 AbstractCegarLoop]: Abstraction has 3906 states and 12585 transitions. [2019-12-18 19:26:23,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 12585 transitions. [2019-12-18 19:26:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:23,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:23,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:23,575 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash -741528550, now seen corresponding path program 8 times [2019-12-18 19:26:23,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:23,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016822461] [2019-12-18 19:26:23,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:24,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016822461] [2019-12-18 19:26:24,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:24,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:24,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696856360] [2019-12-18 19:26:24,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:24,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:24,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:24,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:24,186 INFO L87 Difference]: Start difference. First operand 3906 states and 12585 transitions. Second operand 13 states. [2019-12-18 19:26:25,231 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-18 19:26:26,248 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 19:26:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:26,766 INFO L93 Difference]: Finished difference Result 4676 states and 14925 transitions. [2019-12-18 19:26:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:26,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:26,774 INFO L225 Difference]: With dead ends: 4676 [2019-12-18 19:26:26,774 INFO L226 Difference]: Without dead ends: 4676 [2019-12-18 19:26:26,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2019-12-18 19:26:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 3738. [2019-12-18 19:26:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-12-18 19:26:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 12057 transitions. [2019-12-18 19:26:26,854 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 12057 transitions. Word has length 25 [2019-12-18 19:26:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:26,854 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 12057 transitions. [2019-12-18 19:26:26,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 12057 transitions. [2019-12-18 19:26:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:26,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:26,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:26,864 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1887146998, now seen corresponding path program 9 times [2019-12-18 19:26:26,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:26,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540678605] [2019-12-18 19:26:26,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:27,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540678605] [2019-12-18 19:26:27,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:27,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:27,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783797578] [2019-12-18 19:26:27,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:27,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:27,282 INFO L87 Difference]: Start difference. First operand 3738 states and 12057 transitions. Second operand 13 states. [2019-12-18 19:26:29,031 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-18 19:26:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:29,651 INFO L93 Difference]: Finished difference Result 4522 states and 14364 transitions. [2019-12-18 19:26:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:29,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:29,658 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 19:26:29,658 INFO L226 Difference]: Without dead ends: 4522 [2019-12-18 19:26:29,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2019-12-18 19:26:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3612. [2019-12-18 19:26:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2019-12-18 19:26:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 11584 transitions. [2019-12-18 19:26:29,727 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 11584 transitions. Word has length 25 [2019-12-18 19:26:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:29,728 INFO L462 AbstractCegarLoop]: Abstraction has 3612 states and 11584 transitions. [2019-12-18 19:26:29,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 11584 transitions. [2019-12-18 19:26:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:29,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:29,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:29,734 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 831016779, now seen corresponding path program 6 times [2019-12-18 19:26:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:29,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623122101] [2019-12-18 19:26:29,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:30,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623122101] [2019-12-18 19:26:30,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:30,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:30,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654412398] [2019-12-18 19:26:30,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:30,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:30,169 INFO L87 Difference]: Start difference. First operand 3612 states and 11584 transitions. Second operand 14 states. [2019-12-18 19:26:31,348 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-18 19:26:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:31,928 INFO L93 Difference]: Finished difference Result 3727 states and 11871 transitions. [2019-12-18 19:26:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:26:31,928 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:31,934 INFO L225 Difference]: With dead ends: 3727 [2019-12-18 19:26:31,934 INFO L226 Difference]: Without dead ends: 3727 [2019-12-18 19:26:31,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:26:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2019-12-18 19:26:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3661. [2019-12-18 19:26:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3661 states. [2019-12-18 19:26:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 11739 transitions. [2019-12-18 19:26:32,002 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 11739 transitions. Word has length 25 [2019-12-18 19:26:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:32,003 INFO L462 AbstractCegarLoop]: Abstraction has 3661 states and 11739 transitions. [2019-12-18 19:26:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 11739 transitions. [2019-12-18 19:26:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:32,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:32,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:32,008 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1562377541, now seen corresponding path program 7 times [2019-12-18 19:26:32,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:32,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310225736] [2019-12-18 19:26:32,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:32,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310225736] [2019-12-18 19:26:32,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:32,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:32,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620843650] [2019-12-18 19:26:32,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:32,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:32,469 INFO L87 Difference]: Start difference. First operand 3661 states and 11739 transitions. Second operand 14 states. [2019-12-18 19:26:33,595 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-18 19:26:33,818 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 19:26:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:34,166 INFO L93 Difference]: Finished difference Result 4179 states and 13299 transitions. [2019-12-18 19:26:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:26:34,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:34,172 INFO L225 Difference]: With dead ends: 4179 [2019-12-18 19:26:34,173 INFO L226 Difference]: Without dead ends: 4179 [2019-12-18 19:26:34,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:26:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2019-12-18 19:26:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3724. [2019-12-18 19:26:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-12-18 19:26:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 11982 transitions. [2019-12-18 19:26:34,240 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 11982 transitions. Word has length 25 [2019-12-18 19:26:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:34,240 INFO L462 AbstractCegarLoop]: Abstraction has 3724 states and 11982 transitions. [2019-12-18 19:26:34,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 11982 transitions. [2019-12-18 19:26:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:34,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:34,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:34,246 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash -557535459, now seen corresponding path program 8 times [2019-12-18 19:26:34,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:34,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237037207] [2019-12-18 19:26:34,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:34,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237037207] [2019-12-18 19:26:34,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:34,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:34,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483789762] [2019-12-18 19:26:34,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:34,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:34,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:34,759 INFO L87 Difference]: Start difference. First operand 3724 states and 11982 transitions. Second operand 14 states. [2019-12-18 19:26:36,218 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 19:26:36,847 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 19:26:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:37,272 INFO L93 Difference]: Finished difference Result 4145 states and 13127 transitions. [2019-12-18 19:26:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:37,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:37,278 INFO L225 Difference]: With dead ends: 4145 [2019-12-18 19:26:37,279 INFO L226 Difference]: Without dead ends: 4145 [2019-12-18 19:26:37,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:26:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2019-12-18 19:26:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3913. [2019-12-18 19:26:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-18 19:26:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 12549 transitions. [2019-12-18 19:26:37,330 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 12549 transitions. Word has length 25 [2019-12-18 19:26:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:37,330 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 12549 transitions. [2019-12-18 19:26:37,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 12549 transitions. [2019-12-18 19:26:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:37,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:37,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:37,336 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1540353157, now seen corresponding path program 9 times [2019-12-18 19:26:37,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:37,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176816646] [2019-12-18 19:26:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:37,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176816646] [2019-12-18 19:26:37,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:37,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:37,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118680446] [2019-12-18 19:26:37,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:37,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:37,748 INFO L87 Difference]: Start difference. First operand 3913 states and 12549 transitions. Second operand 14 states. [2019-12-18 19:26:39,748 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-18 19:26:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:40,115 INFO L93 Difference]: Finished difference Result 4117 states and 13043 transitions. [2019-12-18 19:26:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:40,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:40,121 INFO L225 Difference]: With dead ends: 4117 [2019-12-18 19:26:40,121 INFO L226 Difference]: Without dead ends: 4117 [2019-12-18 19:26:40,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:26:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-12-18 19:26:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3976. [2019-12-18 19:26:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-12-18 19:26:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 12738 transitions. [2019-12-18 19:26:40,169 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 12738 transitions. Word has length 25 [2019-12-18 19:26:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:40,170 INFO L462 AbstractCegarLoop]: Abstraction has 3976 states and 12738 transitions. [2019-12-18 19:26:40,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 12738 transitions. [2019-12-18 19:26:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:40,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:40,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:40,174 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:40,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1880873459, now seen corresponding path program 10 times [2019-12-18 19:26:40,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:40,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245542917] [2019-12-18 19:26:40,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:40,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245542917] [2019-12-18 19:26:40,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:40,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:40,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644780580] [2019-12-18 19:26:40,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:40,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:40,647 INFO L87 Difference]: Start difference. First operand 3976 states and 12738 transitions. Second operand 14 states. [2019-12-18 19:26:42,997 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 19:26:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:43,276 INFO L93 Difference]: Finished difference Result 4726 states and 14878 transitions. [2019-12-18 19:26:43,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:26:43,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:43,283 INFO L225 Difference]: With dead ends: 4726 [2019-12-18 19:26:43,283 INFO L226 Difference]: Without dead ends: 4726 [2019-12-18 19:26:43,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:26:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-12-18 19:26:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3542. [2019-12-18 19:26:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2019-12-18 19:26:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2019-12-18 19:26:43,336 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2019-12-18 19:26:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:43,337 INFO L462 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2019-12-18 19:26:43,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2019-12-18 19:26:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:43,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:43,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:43,341 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash -110028251, now seen corresponding path program 11 times [2019-12-18 19:26:43,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:43,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836223869] [2019-12-18 19:26:43,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:43,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836223869] [2019-12-18 19:26:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:43,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043364812] [2019-12-18 19:26:43,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:43,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:43,803 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 14 states. [2019-12-18 19:26:44,718 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-18 19:26:45,030 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 19:26:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:45,346 INFO L93 Difference]: Finished difference Result 3644 states and 11622 transitions. [2019-12-18 19:26:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:26:45,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:45,352 INFO L225 Difference]: With dead ends: 3644 [2019-12-18 19:26:45,352 INFO L226 Difference]: Without dead ends: 3644 [2019-12-18 19:26:45,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:26:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-12-18 19:26:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3584. [2019-12-18 19:26:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 19:26:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11502 transitions. [2019-12-18 19:26:45,396 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11502 transitions. Word has length 25 [2019-12-18 19:26:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:45,396 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 11502 transitions. [2019-12-18 19:26:45,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11502 transitions. [2019-12-18 19:26:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:45,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:45,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:45,400 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2065026045, now seen corresponding path program 12 times [2019-12-18 19:26:45,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:45,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627859209] [2019-12-18 19:26:45,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:45,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627859209] [2019-12-18 19:26:45,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:45,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:45,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33348606] [2019-12-18 19:26:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:45,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:45,885 INFO L87 Difference]: Start difference. First operand 3584 states and 11502 transitions. Second operand 14 states. [2019-12-18 19:26:47,615 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 19:26:47,894 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 19:26:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:48,341 INFO L93 Difference]: Finished difference Result 3945 states and 12527 transitions. [2019-12-18 19:26:48,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:26:48,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:48,351 INFO L225 Difference]: With dead ends: 3945 [2019-12-18 19:26:48,352 INFO L226 Difference]: Without dead ends: 3945 [2019-12-18 19:26:48,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:26:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2019-12-18 19:26:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3773. [2019-12-18 19:26:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2019-12-18 19:26:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 12069 transitions. [2019-12-18 19:26:48,433 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 12069 transitions. Word has length 25 [2019-12-18 19:26:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:48,433 INFO L462 AbstractCegarLoop]: Abstraction has 3773 states and 12069 transitions. [2019-12-18 19:26:48,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 12069 transitions. [2019-12-18 19:26:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:48,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:48,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:48,439 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -132052635, now seen corresponding path program 13 times [2019-12-18 19:26:48,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:48,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912747778] [2019-12-18 19:26:48,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:48,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912747778] [2019-12-18 19:26:48,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:48,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:48,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139824541] [2019-12-18 19:26:48,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:48,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:48,852 INFO L87 Difference]: Start difference. First operand 3773 states and 12069 transitions. Second operand 14 states. [2019-12-18 19:26:50,783 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-18 19:26:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:51,139 INFO L93 Difference]: Finished difference Result 3917 states and 12443 transitions. [2019-12-18 19:26:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:26:51,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:51,145 INFO L225 Difference]: With dead ends: 3917 [2019-12-18 19:26:51,145 INFO L226 Difference]: Without dead ends: 3917 [2019-12-18 19:26:51,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:26:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2019-12-18 19:26:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3836. [2019-12-18 19:26:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-12-18 19:26:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12258 transitions. [2019-12-18 19:26:51,190 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12258 transitions. Word has length 25 [2019-12-18 19:26:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:51,191 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 12258 transitions. [2019-12-18 19:26:51,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12258 transitions. [2019-12-18 19:26:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:51,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:51,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:51,195 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash 741688045, now seen corresponding path program 14 times [2019-12-18 19:26:51,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:51,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344467677] [2019-12-18 19:26:51,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:51,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344467677] [2019-12-18 19:26:51,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:51,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:51,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117824708] [2019-12-18 19:26:51,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:51,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:51,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:51,638 INFO L87 Difference]: Start difference. First operand 3836 states and 12258 transitions. Second operand 14 states. [2019-12-18 19:26:54,102 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 19:26:54,374 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 19:26:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:54,692 INFO L93 Difference]: Finished difference Result 4526 states and 14278 transitions. [2019-12-18 19:26:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:26:54,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:54,699 INFO L225 Difference]: With dead ends: 4526 [2019-12-18 19:26:54,699 INFO L226 Difference]: Without dead ends: 4526 [2019-12-18 19:26:54,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:26:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-12-18 19:26:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3472. [2019-12-18 19:26:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-12-18 19:26:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 11104 transitions. [2019-12-18 19:26:54,746 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 11104 transitions. Word has length 25 [2019-12-18 19:26:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:54,746 INFO L462 AbstractCegarLoop]: Abstraction has 3472 states and 11104 transitions. [2019-12-18 19:26:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 11104 transitions. [2019-12-18 19:26:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:54,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:54,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:54,750 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1027185563, now seen corresponding path program 15 times [2019-12-18 19:26:54,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:54,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081273906] [2019-12-18 19:26:54,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:55,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081273906] [2019-12-18 19:26:55,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:55,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:55,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434691914] [2019-12-18 19:26:55,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:55,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:55,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:55,286 INFO L87 Difference]: Start difference. First operand 3472 states and 11104 transitions. Second operand 14 states. [2019-12-18 19:26:56,512 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 19:26:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:57,037 INFO L93 Difference]: Finished difference Result 3570 states and 11323 transitions. [2019-12-18 19:26:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:26:57,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:57,043 INFO L225 Difference]: With dead ends: 3570 [2019-12-18 19:26:57,043 INFO L226 Difference]: Without dead ends: 3570 [2019-12-18 19:26:57,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:26:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-12-18 19:26:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3570. [2019-12-18 19:26:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2019-12-18 19:26:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 11323 transitions. [2019-12-18 19:26:57,086 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 11323 transitions. Word has length 25 [2019-12-18 19:26:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:57,086 INFO L462 AbstractCegarLoop]: Abstraction has 3570 states and 11323 transitions. [2019-12-18 19:26:57,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 11323 transitions. [2019-12-18 19:26:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:57,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:57,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:57,089 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash -5811913, now seen corresponding path program 16 times [2019-12-18 19:26:57,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:57,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432239612] [2019-12-18 19:26:57,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:57,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432239612] [2019-12-18 19:26:57,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:57,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:57,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805714270] [2019-12-18 19:26:57,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:57,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:57,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:57,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:57,551 INFO L87 Difference]: Start difference. First operand 3570 states and 11323 transitions. Second operand 14 states. [2019-12-18 19:26:59,457 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 19:26:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:59,803 INFO L93 Difference]: Finished difference Result 3591 states and 11388 transitions. [2019-12-18 19:26:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:26:59,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:59,811 INFO L225 Difference]: With dead ends: 3591 [2019-12-18 19:26:59,811 INFO L226 Difference]: Without dead ends: 3591 [2019-12-18 19:26:59,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:26:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2019-12-18 19:26:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3493. [2019-12-18 19:26:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2019-12-18 19:26:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 11092 transitions. [2019-12-18 19:26:59,871 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 11092 transitions. Word has length 25 [2019-12-18 19:26:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:59,871 INFO L462 AbstractCegarLoop]: Abstraction has 3493 states and 11092 transitions. [2019-12-18 19:26:59,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 11092 transitions. [2019-12-18 19:26:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:59,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:59,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:59,875 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:26:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1070703053, now seen corresponding path program 17 times [2019-12-18 19:26:59,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:59,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441469512] [2019-12-18 19:26:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:00,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441469512] [2019-12-18 19:27:00,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444293423] [2019-12-18 19:27:00,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:27:00,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:27:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:27:00,331 INFO L87 Difference]: Start difference. First operand 3493 states and 11092 transitions. Second operand 14 states. [2019-12-18 19:27:02,531 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 19:27:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:02,934 INFO L93 Difference]: Finished difference Result 3577 states and 11346 transitions. [2019-12-18 19:27:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:02,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:27:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:02,939 INFO L225 Difference]: With dead ends: 3577 [2019-12-18 19:27:02,940 INFO L226 Difference]: Without dead ends: 3577 [2019-12-18 19:27:02,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:27:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2019-12-18 19:27:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3556. [2019-12-18 19:27:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-12-18 19:27:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 11281 transitions. [2019-12-18 19:27:02,982 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 11281 transitions. Word has length 25 [2019-12-18 19:27:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:02,982 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 11281 transitions. [2019-12-18 19:27:02,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:27:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 11281 transitions. [2019-12-18 19:27:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:02,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:02,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:02,986 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443733, now seen corresponding path program 18 times [2019-12-18 19:27:02,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:02,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056996865] [2019-12-18 19:27:02,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:03,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-18 19:27:03,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056996865] [2019-12-18 19:27:03,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:03,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:03,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850935783] [2019-12-18 19:27:03,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:27:03,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:27:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:27:03,438 INFO L87 Difference]: Start difference. First operand 3556 states and 11281 transitions. Second operand 14 states. [2019-12-18 19:27:06,740 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-18 19:27:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:07,081 INFO L93 Difference]: Finished difference Result 4186 states and 13181 transitions. [2019-12-18 19:27:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:27:07,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:27:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:07,088 INFO L225 Difference]: With dead ends: 4186 [2019-12-18 19:27:07,088 INFO L226 Difference]: Without dead ends: 4186 [2019-12-18 19:27:07,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=345, Invalid=777, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:27:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2019-12-18 19:27:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3262. [2019-12-18 19:27:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-12-18 19:27:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 10397 transitions. [2019-12-18 19:27:07,139 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 10397 transitions. Word has length 25 [2019-12-18 19:27:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:07,140 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 10397 transitions. [2019-12-18 19:27:07,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:27:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 10397 transitions. [2019-12-18 19:27:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:07,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:07,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:07,143 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 137738405, now seen corresponding path program 19 times [2019-12-18 19:27:07,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:07,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546443857] [2019-12-18 19:27:07,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:07,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546443857] [2019-12-18 19:27:07,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:07,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:07,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280176746] [2019-12-18 19:27:07,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:27:07,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:27:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:27:07,607 INFO L87 Difference]: Start difference. First operand 3262 states and 10397 transitions. Second operand 14 states. [2019-12-18 19:27:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:09,314 INFO L93 Difference]: Finished difference Result 3276 states and 10441 transitions. [2019-12-18 19:27:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:27:09,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:27:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:09,321 INFO L225 Difference]: With dead ends: 3276 [2019-12-18 19:27:09,321 INFO L226 Difference]: Without dead ends: 3276 [2019-12-18 19:27:09,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:27:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-12-18 19:27:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2019-12-18 19:27:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-12-18 19:27:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 10441 transitions. [2019-12-18 19:27:09,365 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 10441 transitions. Word has length 25 [2019-12-18 19:27:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:09,366 INFO L462 AbstractCegarLoop]: Abstraction has 3276 states and 10441 transitions. [2019-12-18 19:27:09,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:27:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 10441 transitions. [2019-12-18 19:27:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:27:09,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:09,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:09,368 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:09,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1011479085, now seen corresponding path program 20 times [2019-12-18 19:27:09,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:09,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794946087] [2019-12-18 19:27:09,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:09,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794946087] [2019-12-18 19:27:09,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:09,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:09,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904948930] [2019-12-18 19:27:09,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:27:09,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:27:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:27:09,862 INFO L87 Difference]: Start difference. First operand 3276 states and 10441 transitions. Second operand 14 states. [2019-12-18 19:27:13,138 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-12-18 19:27:13,302 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 19:27:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:13,686 INFO L93 Difference]: Finished difference Result 4060 states and 12825 transitions. [2019-12-18 19:27:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 19:27:13,686 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:27:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:13,692 INFO L225 Difference]: With dead ends: 4060 [2019-12-18 19:27:13,692 INFO L226 Difference]: Without dead ends: 4060 [2019-12-18 19:27:13,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:27:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2019-12-18 19:27:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3206. [2019-12-18 19:27:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2019-12-18 19:27:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2019-12-18 19:27:13,742 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2019-12-18 19:27:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:13,742 INFO L462 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2019-12-18 19:27:13,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:27:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2019-12-18 19:27:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:13,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:13,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:13,746 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876017, now seen corresponding path program 1 times [2019-12-18 19:27:13,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:13,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031665673] [2019-12-18 19:27:13,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:14,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031665673] [2019-12-18 19:27:14,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:14,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:14,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198344515] [2019-12-18 19:27:14,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:14,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:14,493 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 16 states. [2019-12-18 19:27:16,065 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 19:27:16,271 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-18 19:27:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:17,441 INFO L93 Difference]: Finished difference Result 5231 states and 16874 transitions. [2019-12-18 19:27:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:17,441 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:17,451 INFO L225 Difference]: With dead ends: 5231 [2019-12-18 19:27:17,451 INFO L226 Difference]: Without dead ends: 5231 [2019-12-18 19:27:17,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2019-12-18 19:27:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3768. [2019-12-18 19:27:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2019-12-18 19:27:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12142 transitions. [2019-12-18 19:27:17,505 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12142 transitions. Word has length 27 [2019-12-18 19:27:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 3768 states and 12142 transitions. [2019-12-18 19:27:17,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12142 transitions. [2019-12-18 19:27:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:17,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:17,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:17,509 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876023, now seen corresponding path program 1 times [2019-12-18 19:27:17,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:17,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690419579] [2019-12-18 19:27:17,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:18,103 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-12-18 19:27:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690419579] [2019-12-18 19:27:18,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:18,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:18,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192880279] [2019-12-18 19:27:18,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:18,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:18,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:18,320 INFO L87 Difference]: Start difference. First operand 3768 states and 12142 transitions. Second operand 16 states. [2019-12-18 19:27:19,604 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 19:27:19,816 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 19:27:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:20,594 INFO L93 Difference]: Finished difference Result 5138 states and 16527 transitions. [2019-12-18 19:27:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:20,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:20,604 INFO L225 Difference]: With dead ends: 5138 [2019-12-18 19:27:20,604 INFO L226 Difference]: Without dead ends: 5138 [2019-12-18 19:27:20,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2019-12-18 19:27:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3768. [2019-12-18 19:27:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2019-12-18 19:27:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12049 transitions. [2019-12-18 19:27:20,656 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12049 transitions. Word has length 27 [2019-12-18 19:27:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:20,656 INFO L462 AbstractCegarLoop]: Abstraction has 3768 states and 12049 transitions. [2019-12-18 19:27:20,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12049 transitions. [2019-12-18 19:27:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:20,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:20,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:20,660 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 186176923, now seen corresponding path program 2 times [2019-12-18 19:27:20,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:20,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584375997] [2019-12-18 19:27:20,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:21,203 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2019-12-18 19:27:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:21,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584375997] [2019-12-18 19:27:21,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:21,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:21,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476201962] [2019-12-18 19:27:21,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:21,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:21,412 INFO L87 Difference]: Start difference. First operand 3768 states and 12049 transitions. Second operand 16 states. [2019-12-18 19:27:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:23,985 INFO L93 Difference]: Finished difference Result 6291 states and 20340 transitions. [2019-12-18 19:27:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:23,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:23,995 INFO L225 Difference]: With dead ends: 6291 [2019-12-18 19:27:23,995 INFO L226 Difference]: Without dead ends: 6291 [2019-12-18 19:27:23,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2019-12-18 19:27:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 4456. [2019-12-18 19:27:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2019-12-18 19:27:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 14338 transitions. [2019-12-18 19:27:24,057 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 14338 transitions. Word has length 27 [2019-12-18 19:27:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:24,057 INFO L462 AbstractCegarLoop]: Abstraction has 4456 states and 14338 transitions. [2019-12-18 19:27:24,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 14338 transitions. [2019-12-18 19:27:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:24,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:24,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:24,061 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 186176917, now seen corresponding path program 2 times [2019-12-18 19:27:24,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:24,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374365580] [2019-12-18 19:27:24,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:24,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374365580] [2019-12-18 19:27:24,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:24,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:24,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377814420] [2019-12-18 19:27:24,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:24,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:24,819 INFO L87 Difference]: Start difference. First operand 4456 states and 14338 transitions. Second operand 16 states. [2019-12-18 19:27:26,177 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-12-18 19:27:26,344 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-18 19:27:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:27,256 INFO L93 Difference]: Finished difference Result 5769 states and 18546 transitions. [2019-12-18 19:27:27,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:27,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:27,265 INFO L225 Difference]: With dead ends: 5769 [2019-12-18 19:27:27,265 INFO L226 Difference]: Without dead ends: 5769 [2019-12-18 19:27:27,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-12-18 19:27:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 3978. [2019-12-18 19:27:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-18 19:27:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 12679 transitions. [2019-12-18 19:27:27,322 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 12679 transitions. Word has length 27 [2019-12-18 19:27:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:27,323 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 12679 transitions. [2019-12-18 19:27:27,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 12679 transitions. [2019-12-18 19:27:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:27,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:27,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:27,326 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843469, now seen corresponding path program 3 times [2019-12-18 19:27:27,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:27,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872280671] [2019-12-18 19:27:27,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:27,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872280671] [2019-12-18 19:27:27,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:27,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:27,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506314382] [2019-12-18 19:27:27,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:27,958 INFO L87 Difference]: Start difference. First operand 3978 states and 12679 transitions. Second operand 15 states. [2019-12-18 19:27:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:30,483 INFO L93 Difference]: Finished difference Result 6136 states and 19924 transitions. [2019-12-18 19:27:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:30,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:30,492 INFO L225 Difference]: With dead ends: 6136 [2019-12-18 19:27:30,492 INFO L226 Difference]: Without dead ends: 6136 [2019-12-18 19:27:30,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:27:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2019-12-18 19:27:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4998. [2019-12-18 19:27:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 19:27:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 16068 transitions. [2019-12-18 19:27:30,559 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 16068 transitions. Word has length 27 [2019-12-18 19:27:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:30,559 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 16068 transitions. [2019-12-18 19:27:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 16068 transitions. [2019-12-18 19:27:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:30,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:30,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:30,564 INFO L410 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843463, now seen corresponding path program 3 times [2019-12-18 19:27:30,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:30,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749525953] [2019-12-18 19:27:30,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:31,101 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2019-12-18 19:27:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:31,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749525953] [2019-12-18 19:27:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:31,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:31,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681197697] [2019-12-18 19:27:31,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:31,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:31,340 INFO L87 Difference]: Start difference. First operand 4998 states and 16068 transitions. Second operand 15 states. [2019-12-18 19:27:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:33,739 INFO L93 Difference]: Finished difference Result 6136 states and 19779 transitions. [2019-12-18 19:27:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:33,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:33,749 INFO L225 Difference]: With dead ends: 6136 [2019-12-18 19:27:33,749 INFO L226 Difference]: Without dead ends: 6136 [2019-12-18 19:27:33,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:27:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2019-12-18 19:27:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4506. [2019-12-18 19:27:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-12-18 19:27:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2019-12-18 19:27:33,812 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2019-12-18 19:27:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:33,812 INFO L462 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2019-12-18 19:27:33,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2019-12-18 19:27:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:33,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:33,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:33,816 INFO L410 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 707987975, now seen corresponding path program 1 times [2019-12-18 19:27:33,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:33,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576851288] [2019-12-18 19:27:33,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:34,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576851288] [2019-12-18 19:27:34,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:34,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:27:34,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925092897] [2019-12-18 19:27:34,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:27:34,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:27:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:27:34,649 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2019-12-18 19:27:35,869 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 19:27:36,059 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 19:27:36,358 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 19:27:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:37,947 INFO L93 Difference]: Finished difference Result 6526 states and 21072 transitions. [2019-12-18 19:27:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:37,947 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:27:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:37,957 INFO L225 Difference]: With dead ends: 6526 [2019-12-18 19:27:37,957 INFO L226 Difference]: Without dead ends: 6526 [2019-12-18 19:27:37,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:27:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2019-12-18 19:27:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 5060. [2019-12-18 19:27:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2019-12-18 19:27:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16254 transitions. [2019-12-18 19:27:38,025 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16254 transitions. Word has length 27 [2019-12-18 19:27:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:38,025 INFO L462 AbstractCegarLoop]: Abstraction has 5060 states and 16254 transitions. [2019-12-18 19:27:38,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:27:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16254 transitions. [2019-12-18 19:27:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:38,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:38,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:38,029 INFO L410 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash 707987969, now seen corresponding path program 1 times [2019-12-18 19:27:38,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:38,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256289746] [2019-12-18 19:27:38,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:38,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256289746] [2019-12-18 19:27:38,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:38,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:27:38,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531620860] [2019-12-18 19:27:38,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:27:38,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:27:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:27:38,808 INFO L87 Difference]: Start difference. First operand 5060 states and 16254 transitions. Second operand 17 states. [2019-12-18 19:27:39,982 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 19:27:40,223 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 19:27:40,422 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 19:27:40,637 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 19:27:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:41,698 INFO L93 Difference]: Finished difference Result 6526 states and 20927 transitions. [2019-12-18 19:27:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:41,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:27:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:41,708 INFO L225 Difference]: With dead ends: 6526 [2019-12-18 19:27:41,708 INFO L226 Difference]: Without dead ends: 6526 [2019-12-18 19:27:41,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:27:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2019-12-18 19:27:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 4736. [2019-12-18 19:27:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2019-12-18 19:27:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2019-12-18 19:27:41,777 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2019-12-18 19:27:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:41,777 INFO L462 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2019-12-18 19:27:41,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:27:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2019-12-18 19:27:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:41,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:41,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:41,781 INFO L410 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash -828956287, now seen corresponding path program 2 times [2019-12-18 19:27:41,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:41,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603629824] [2019-12-18 19:27:41,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:42,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603629824] [2019-12-18 19:27:42,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:42,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:27:42,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253652827] [2019-12-18 19:27:42,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:27:42,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:27:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:27:42,532 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2019-12-18 19:27:43,698 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-18 19:27:43,934 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-18 19:27:44,297 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-18 19:27:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:45,417 INFO L93 Difference]: Finished difference Result 7234 states and 23377 transitions. [2019-12-18 19:27:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:45,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:27:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:45,427 INFO L225 Difference]: With dead ends: 7234 [2019-12-18 19:27:45,427 INFO L226 Difference]: Without dead ends: 7234 [2019-12-18 19:27:45,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:27:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2019-12-18 19:27:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 5278. [2019-12-18 19:27:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2019-12-18 19:27:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 16935 transitions. [2019-12-18 19:27:45,503 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 16935 transitions. Word has length 27 [2019-12-18 19:27:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 5278 states and 16935 transitions. [2019-12-18 19:27:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:27:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 16935 transitions. [2019-12-18 19:27:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:45,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:45,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:45,508 INFO L410 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -828956293, now seen corresponding path program 2 times [2019-12-18 19:27:45,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:45,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258246116] [2019-12-18 19:27:45,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:46,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258246116] [2019-12-18 19:27:46,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:46,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:27:46,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525601050] [2019-12-18 19:27:46,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:27:46,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:27:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:27:46,299 INFO L87 Difference]: Start difference. First operand 5278 states and 16935 transitions. Second operand 17 states. [2019-12-18 19:27:47,560 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-12-18 19:27:47,723 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-18 19:27:47,968 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-18 19:27:48,164 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-12-18 19:27:48,391 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-18 19:27:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:49,668 INFO L93 Difference]: Finished difference Result 6805 states and 21785 transitions. [2019-12-18 19:27:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:49,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:27:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:49,678 INFO L225 Difference]: With dead ends: 6805 [2019-12-18 19:27:49,678 INFO L226 Difference]: Without dead ends: 6805 [2019-12-18 19:27:49,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:27:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2019-12-18 19:27:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 4796. [2019-12-18 19:27:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4796 states. [2019-12-18 19:27:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 15264 transitions. [2019-12-18 19:27:49,744 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 15264 transitions. Word has length 27 [2019-12-18 19:27:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:49,744 INFO L462 AbstractCegarLoop]: Abstraction has 4796 states and 15264 transitions. [2019-12-18 19:27:49,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:27:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 15264 transitions. [2019-12-18 19:27:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:49,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:49,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:49,749 INFO L410 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116313, now seen corresponding path program 3 times [2019-12-18 19:27:49,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:49,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306080888] [2019-12-18 19:27:49,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:50,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306080888] [2019-12-18 19:27:50,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:50,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:50,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258401449] [2019-12-18 19:27:50,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:50,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:50,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:50,459 INFO L87 Difference]: Start difference. First operand 4796 states and 15264 transitions. Second operand 16 states. [2019-12-18 19:27:51,509 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 19:27:51,995 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-18 19:27:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:53,565 INFO L93 Difference]: Finished difference Result 7448 states and 24096 transitions. [2019-12-18 19:27:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:53,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:53,576 INFO L225 Difference]: With dead ends: 7448 [2019-12-18 19:27:53,576 INFO L226 Difference]: Without dead ends: 7448 [2019-12-18 19:27:53,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2019-12-18 19:27:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5986. [2019-12-18 19:27:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2019-12-18 19:27:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 19163 transitions. [2019-12-18 19:27:53,655 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 19163 transitions. Word has length 27 [2019-12-18 19:27:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:53,655 INFO L462 AbstractCegarLoop]: Abstraction has 5986 states and 19163 transitions. [2019-12-18 19:27:53,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 19163 transitions. [2019-12-18 19:27:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:53,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:53,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:53,661 INFO L410 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116307, now seen corresponding path program 3 times [2019-12-18 19:27:53,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:53,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724299772] [2019-12-18 19:27:53,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:54,020 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-12-18 19:27:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:54,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724299772] [2019-12-18 19:27:54,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:54,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:54,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549676795] [2019-12-18 19:27:54,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:54,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:54,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:54,502 INFO L87 Difference]: Start difference. First operand 5986 states and 19163 transitions. Second operand 16 states. [2019-12-18 19:27:56,076 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 19:27:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:57,664 INFO L93 Difference]: Finished difference Result 7019 states and 22504 transitions. [2019-12-18 19:27:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:57,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:57,675 INFO L225 Difference]: With dead ends: 7019 [2019-12-18 19:27:57,675 INFO L226 Difference]: Without dead ends: 7019 [2019-12-18 19:27:57,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7019 states. [2019-12-18 19:27:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7019 to 5180. [2019-12-18 19:27:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-12-18 19:27:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 16448 transitions. [2019-12-18 19:27:57,759 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 16448 transitions. Word has length 27 [2019-12-18 19:27:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:57,759 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 16448 transitions. [2019-12-18 19:27:57,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 16448 transitions. [2019-12-18 19:27:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:57,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:57,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:57,766 INFO L410 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:27:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1764177885, now seen corresponding path program 4 times [2019-12-18 19:27:57,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:57,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85331323] [2019-12-18 19:27:57,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:58,389 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-12-18 19:27:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:58,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85331323] [2019-12-18 19:27:58,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:58,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:58,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645297462] [2019-12-18 19:27:58,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:58,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:58,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:58,668 INFO L87 Difference]: Start difference. First operand 5180 states and 16448 transitions. Second operand 16 states. [2019-12-18 19:27:59,625 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-12-18 19:28:00,130 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-18 19:28:00,328 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 19:28:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:01,370 INFO L93 Difference]: Finished difference Result 6661 states and 21391 transitions. [2019-12-18 19:28:01,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:01,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:01,380 INFO L225 Difference]: With dead ends: 6661 [2019-12-18 19:28:01,380 INFO L226 Difference]: Without dead ends: 6661 [2019-12-18 19:28:01,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-18 19:28:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5107. [2019-12-18 19:28:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-18 19:28:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 16229 transitions. [2019-12-18 19:28:01,452 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 16229 transitions. Word has length 27 [2019-12-18 19:28:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:01,452 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 16229 transitions. [2019-12-18 19:28:01,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 16229 transitions. [2019-12-18 19:28:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:01,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:01,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:01,456 INFO L410 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash -4124945, now seen corresponding path program 5 times [2019-12-18 19:28:01,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:01,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825614478] [2019-12-18 19:28:01,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:02,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825614478] [2019-12-18 19:28:02,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:02,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:02,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541955279] [2019-12-18 19:28:02,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:02,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:02,211 INFO L87 Difference]: Start difference. First operand 5107 states and 16229 transitions. Second operand 16 states. [2019-12-18 19:28:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:05,172 INFO L93 Difference]: Finished difference Result 7579 states and 24444 transitions. [2019-12-18 19:28:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:05,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:05,184 INFO L225 Difference]: With dead ends: 7579 [2019-12-18 19:28:05,185 INFO L226 Difference]: Without dead ends: 7579 [2019-12-18 19:28:05,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-12-18 19:28:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 5774. [2019-12-18 19:28:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5774 states. [2019-12-18 19:28:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 18455 transitions. [2019-12-18 19:28:05,309 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 18455 transitions. Word has length 27 [2019-12-18 19:28:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:05,309 INFO L462 AbstractCegarLoop]: Abstraction has 5774 states and 18455 transitions. [2019-12-18 19:28:05,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 18455 transitions. [2019-12-18 19:28:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:05,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:05,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:05,317 INFO L410 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:05,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash -4124951, now seen corresponding path program 4 times [2019-12-18 19:28:05,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:05,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181296925] [2019-12-18 19:28:05,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:06,088 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-12-18 19:28:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:06,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181296925] [2019-12-18 19:28:06,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:06,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:06,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029155820] [2019-12-18 19:28:06,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:06,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:06,382 INFO L87 Difference]: Start difference. First operand 5774 states and 18455 transitions. Second operand 16 states. [2019-12-18 19:28:08,119 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 19:28:08,316 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 19:28:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:09,491 INFO L93 Difference]: Finished difference Result 7150 states and 22852 transitions. [2019-12-18 19:28:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:28:09,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:09,503 INFO L225 Difference]: With dead ends: 7150 [2019-12-18 19:28:09,503 INFO L226 Difference]: Without dead ends: 7150 [2019-12-18 19:28:09,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:28:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2019-12-18 19:28:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 5296. [2019-12-18 19:28:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-12-18 19:28:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 16796 transitions. [2019-12-18 19:28:09,579 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 16796 transitions. Word has length 27 [2019-12-18 19:28:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:09,579 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 16796 transitions. [2019-12-18 19:28:09,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 16796 transitions. [2019-12-18 19:28:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:09,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:09,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:09,583 INFO L410 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541601, now seen corresponding path program 6 times [2019-12-18 19:28:09,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:09,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838601824] [2019-12-18 19:28:09,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:10,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838601824] [2019-12-18 19:28:10,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:10,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:10,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900299152] [2019-12-18 19:28:10,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:10,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:10,147 INFO L87 Difference]: Start difference. First operand 5296 states and 16796 transitions. Second operand 15 states. [2019-12-18 19:28:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:12,718 INFO L93 Difference]: Finished difference Result 7946 states and 25649 transitions. [2019-12-18 19:28:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:28:12,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:12,730 INFO L225 Difference]: With dead ends: 7946 [2019-12-18 19:28:12,730 INFO L226 Difference]: Without dead ends: 7946 [2019-12-18 19:28:12,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:28:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2019-12-18 19:28:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 6316. [2019-12-18 19:28:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-12-18 19:28:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 20185 transitions. [2019-12-18 19:28:12,839 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 20185 transitions. Word has length 27 [2019-12-18 19:28:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:12,839 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 20185 transitions. [2019-12-18 19:28:12,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 20185 transitions. [2019-12-18 19:28:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:12,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:12,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:12,847 INFO L410 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541595, now seen corresponding path program 5 times [2019-12-18 19:28:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445776728] [2019-12-18 19:28:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445776728] [2019-12-18 19:28:13,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:13,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:13,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097334191] [2019-12-18 19:28:13,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:13,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:13,430 INFO L87 Difference]: Start difference. First operand 6316 states and 20185 transitions. Second operand 15 states. [2019-12-18 19:28:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:16,180 INFO L93 Difference]: Finished difference Result 7946 states and 25504 transitions. [2019-12-18 19:28:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:28:16,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:16,192 INFO L225 Difference]: With dead ends: 7946 [2019-12-18 19:28:16,192 INFO L226 Difference]: Without dead ends: 7946 [2019-12-18 19:28:16,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:28:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2019-12-18 19:28:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 5044. [2019-12-18 19:28:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2019-12-18 19:28:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16040 transitions. [2019-12-18 19:28:16,325 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16040 transitions. Word has length 27 [2019-12-18 19:28:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:16,325 INFO L462 AbstractCegarLoop]: Abstraction has 5044 states and 16040 transitions. [2019-12-18 19:28:16,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16040 transitions. [2019-12-18 19:28:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:16,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:16,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:16,330 INFO L410 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash 902229065, now seen corresponding path program 7 times [2019-12-18 19:28:16,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:16,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774995091] [2019-12-18 19:28:16,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:16,887 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-12-18 19:28:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:17,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774995091] [2019-12-18 19:28:17,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:17,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:17,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144663755] [2019-12-18 19:28:17,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:17,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:17,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:17,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:17,119 INFO L87 Difference]: Start difference. First operand 5044 states and 16040 transitions. Second operand 16 states. [2019-12-18 19:28:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:20,131 INFO L93 Difference]: Finished difference Result 6556 states and 21221 transitions. [2019-12-18 19:28:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:20,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:20,142 INFO L225 Difference]: With dead ends: 6556 [2019-12-18 19:28:20,142 INFO L226 Difference]: Without dead ends: 6556 [2019-12-18 19:28:20,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states. [2019-12-18 19:28:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 5501. [2019-12-18 19:28:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5501 states. [2019-12-18 19:28:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 17636 transitions. [2019-12-18 19:28:20,216 INFO L78 Accepts]: Start accepts. Automaton has 5501 states and 17636 transitions. Word has length 27 [2019-12-18 19:28:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 5501 states and 17636 transitions. [2019-12-18 19:28:20,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5501 states and 17636 transitions. [2019-12-18 19:28:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:20,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:20,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:20,222 INFO L410 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 902229059, now seen corresponding path program 6 times [2019-12-18 19:28:20,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:20,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142787605] [2019-12-18 19:28:20,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:20,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142787605] [2019-12-18 19:28:20,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:20,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:20,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470374946] [2019-12-18 19:28:20,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:20,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:20,994 INFO L87 Difference]: Start difference. First operand 5501 states and 17636 transitions. Second operand 16 states. [2019-12-18 19:28:21,983 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-18 19:28:22,438 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 19:28:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:23,572 INFO L93 Difference]: Finished difference Result 6127 states and 19629 transitions. [2019-12-18 19:28:23,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:23,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:23,581 INFO L225 Difference]: With dead ends: 6127 [2019-12-18 19:28:23,581 INFO L226 Difference]: Without dead ends: 6127 [2019-12-18 19:28:23,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-12-18 19:28:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5023. [2019-12-18 19:28:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-12-18 19:28:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 15977 transitions. [2019-12-18 19:28:23,646 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 15977 transitions. Word has length 27 [2019-12-18 19:28:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:23,646 INFO L462 AbstractCegarLoop]: Abstraction has 5023 states and 15977 transitions. [2019-12-18 19:28:23,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 15977 transitions. [2019-12-18 19:28:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:23,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:23,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:23,650 INFO L410 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1937071685, now seen corresponding path program 8 times [2019-12-18 19:28:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:23,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807306186] [2019-12-18 19:28:23,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:24,084 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 31 [2019-12-18 19:28:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:24,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807306186] [2019-12-18 19:28:24,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:24,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:24,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079746144] [2019-12-18 19:28:24,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:24,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:24,247 INFO L87 Difference]: Start difference. First operand 5023 states and 15977 transitions. Second operand 15 states. [2019-12-18 19:28:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:26,758 INFO L93 Difference]: Finished difference Result 7736 states and 24874 transitions. [2019-12-18 19:28:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:28:26,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:26,770 INFO L225 Difference]: With dead ends: 7736 [2019-12-18 19:28:26,770 INFO L226 Difference]: Without dead ends: 7736 [2019-12-18 19:28:26,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:28:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2019-12-18 19:28:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 4834. [2019-12-18 19:28:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2019-12-18 19:28:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 15410 transitions. [2019-12-18 19:28:26,842 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 15410 transitions. Word has length 27 [2019-12-18 19:28:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:26,842 INFO L462 AbstractCegarLoop]: Abstraction has 4834 states and 15410 transitions. [2019-12-18 19:28:26,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 15410 transitions. [2019-12-18 19:28:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:26,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:26,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:26,847 INFO L410 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:26,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash 495555017, now seen corresponding path program 9 times [2019-12-18 19:28:26,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:26,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284184714] [2019-12-18 19:28:26,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:27,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284184714] [2019-12-18 19:28:27,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203503097] [2019-12-18 19:28:27,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:27,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:27,453 INFO L87 Difference]: Start difference. First operand 4834 states and 15410 transitions. Second operand 15 states. [2019-12-18 19:28:28,862 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-18 19:28:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:30,856 INFO L93 Difference]: Finished difference Result 8170 states and 26657 transitions. [2019-12-18 19:28:30,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:30,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:30,869 INFO L225 Difference]: With dead ends: 8170 [2019-12-18 19:28:30,869 INFO L226 Difference]: Without dead ends: 8170 [2019-12-18 19:28:30,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2019-12-18 19:28:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5836. [2019-12-18 19:28:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5836 states. [2019-12-18 19:28:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5836 states to 5836 states and 18756 transitions. [2019-12-18 19:28:30,950 INFO L78 Accepts]: Start accepts. Automaton has 5836 states and 18756 transitions. Word has length 27 [2019-12-18 19:28:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:30,950 INFO L462 AbstractCegarLoop]: Abstraction has 5836 states and 18756 transitions. [2019-12-18 19:28:30,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5836 states and 18756 transitions. [2019-12-18 19:28:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:30,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:30,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:30,955 INFO L410 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash 495555011, now seen corresponding path program 7 times [2019-12-18 19:28:30,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:30,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952372363] [2019-12-18 19:28:30,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:31,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952372363] [2019-12-18 19:28:31,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:31,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:31,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526998912] [2019-12-18 19:28:31,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:31,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:31,488 INFO L87 Difference]: Start difference. First operand 5836 states and 18756 transitions. Second operand 15 states. [2019-12-18 19:28:32,754 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-18 19:28:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:34,551 INFO L93 Difference]: Finished difference Result 7741 states and 25065 transitions. [2019-12-18 19:28:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:34,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:34,563 INFO L225 Difference]: With dead ends: 7741 [2019-12-18 19:28:34,563 INFO L226 Difference]: Without dead ends: 7741 [2019-12-18 19:28:34,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2019-12-18 19:28:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 4886. [2019-12-18 19:28:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-12-18 19:28:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 15577 transitions. [2019-12-18 19:28:34,636 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 15577 transitions. Word has length 27 [2019-12-18 19:28:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:34,636 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 15577 transitions. [2019-12-18 19:28:34,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 15577 transitions. [2019-12-18 19:28:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:34,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:34,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:34,641 INFO L410 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385861, now seen corresponding path program 10 times [2019-12-18 19:28:34,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:34,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960504485] [2019-12-18 19:28:34,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:35,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960504485] [2019-12-18 19:28:35,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:35,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274027748] [2019-12-18 19:28:35,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:35,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:35,332 INFO L87 Difference]: Start difference. First operand 4886 states and 15577 transitions. Second operand 15 states. [2019-12-18 19:28:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:37,984 INFO L93 Difference]: Finished difference Result 6800 states and 22058 transitions. [2019-12-18 19:28:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:28:37,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:37,994 INFO L225 Difference]: With dead ends: 6800 [2019-12-18 19:28:37,994 INFO L226 Difference]: Without dead ends: 6800 [2019-12-18 19:28:37,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:28:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-12-18 19:28:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 5696. [2019-12-18 19:28:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2019-12-18 19:28:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 18316 transitions. [2019-12-18 19:28:38,070 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 18316 transitions. Word has length 27 [2019-12-18 19:28:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:38,070 INFO L462 AbstractCegarLoop]: Abstraction has 5696 states and 18316 transitions. [2019-12-18 19:28:38,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 18316 transitions. [2019-12-18 19:28:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:38,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:38,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:38,075 INFO L410 AbstractCegarLoop]: === Iteration 55 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385855, now seen corresponding path program 8 times [2019-12-18 19:28:38,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:38,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145740301] [2019-12-18 19:28:38,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:38,543 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-12-18 19:28:38,704 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-12-18 19:28:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:38,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145740301] [2019-12-18 19:28:38,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:38,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:28:38,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757186801] [2019-12-18 19:28:38,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:28:38,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:28:38,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:28:38,956 INFO L87 Difference]: Start difference. First operand 5696 states and 18316 transitions. Second operand 15 states. [2019-12-18 19:28:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:41,738 INFO L93 Difference]: Finished difference Result 6800 states and 21913 transitions. [2019-12-18 19:28:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:28:41,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:28:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:41,749 INFO L225 Difference]: With dead ends: 6800 [2019-12-18 19:28:41,750 INFO L226 Difference]: Without dead ends: 6800 [2019-12-18 19:28:41,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:28:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-12-18 19:28:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4676. [2019-12-18 19:28:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2019-12-18 19:28:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 14927 transitions. [2019-12-18 19:28:41,816 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 14927 transitions. Word has length 27 [2019-12-18 19:28:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:41,816 INFO L462 AbstractCegarLoop]: Abstraction has 4676 states and 14927 transitions. [2019-12-18 19:28:41,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:28:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 14927 transitions. [2019-12-18 19:28:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:41,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:41,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:41,821 INFO L410 AbstractCegarLoop]: === Iteration 56 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash -783135897, now seen corresponding path program 4 times [2019-12-18 19:28:41,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:41,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084266598] [2019-12-18 19:28:41,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:42,412 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2019-12-18 19:28:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:42,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084266598] [2019-12-18 19:28:42,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:42,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:28:42,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149111074] [2019-12-18 19:28:42,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:28:42,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:28:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:28:42,671 INFO L87 Difference]: Start difference. First operand 4676 states and 14927 transitions. Second operand 17 states. [2019-12-18 19:28:43,885 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-18 19:28:44,101 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-18 19:28:44,360 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 19:28:44,551 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-18 19:28:44,770 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-18 19:28:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:46,144 INFO L93 Difference]: Finished difference Result 6327 states and 20448 transitions. [2019-12-18 19:28:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:46,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:28:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:46,153 INFO L225 Difference]: With dead ends: 6327 [2019-12-18 19:28:46,153 INFO L226 Difference]: Without dead ends: 6327 [2019-12-18 19:28:46,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:28:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2019-12-18 19:28:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 5164. [2019-12-18 19:28:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-12-18 19:28:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 16616 transitions. [2019-12-18 19:28:46,221 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 16616 transitions. Word has length 27 [2019-12-18 19:28:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 5164 states and 16616 transitions. [2019-12-18 19:28:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:28:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 16616 transitions. [2019-12-18 19:28:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:46,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:46,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:46,225 INFO L410 AbstractCegarLoop]: === Iteration 57 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash -783135903, now seen corresponding path program 4 times [2019-12-18 19:28:46,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:46,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115436576] [2019-12-18 19:28:46,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:46,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115436576] [2019-12-18 19:28:46,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:46,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:28:46,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022902181] [2019-12-18 19:28:46,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:28:46,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:28:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:28:46,955 INFO L87 Difference]: Start difference. First operand 5164 states and 16616 transitions. Second operand 17 states. [2019-12-18 19:28:48,835 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 19:28:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:49,994 INFO L93 Difference]: Finished difference Result 5805 states and 18654 transitions. [2019-12-18 19:28:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:49,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:28:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:50,003 INFO L225 Difference]: With dead ends: 5805 [2019-12-18 19:28:50,004 INFO L226 Difference]: Without dead ends: 5805 [2019-12-18 19:28:50,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:28:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-12-18 19:28:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 4670. [2019-12-18 19:28:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-12-18 19:28:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 14909 transitions. [2019-12-18 19:28:50,065 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 14909 transitions. Word has length 27 [2019-12-18 19:28:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:50,066 INFO L462 AbstractCegarLoop]: Abstraction has 4670 states and 14909 transitions. [2019-12-18 19:28:50,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:28:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 14909 transitions. [2019-12-18 19:28:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:50,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:50,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:50,069 INFO L410 AbstractCegarLoop]: === Iteration 58 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887137, now seen corresponding path program 5 times [2019-12-18 19:28:50,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:50,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023945812] [2019-12-18 19:28:50,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:50,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023945812] [2019-12-18 19:28:50,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:50,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:28:50,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774024978] [2019-12-18 19:28:50,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:28:50,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:28:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:28:50,802 INFO L87 Difference]: Start difference. First operand 4670 states and 14909 transitions. Second operand 17 states. [2019-12-18 19:28:52,117 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-12-18 19:28:52,270 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-18 19:28:52,518 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 19:28:52,692 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-18 19:28:52,902 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 19:28:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:54,100 INFO L93 Difference]: Finished difference Result 7210 states and 23183 transitions. [2019-12-18 19:28:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:28:54,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:28:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:54,112 INFO L225 Difference]: With dead ends: 7210 [2019-12-18 19:28:54,112 INFO L226 Difference]: Without dead ends: 7210 [2019-12-18 19:28:54,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:28:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2019-12-18 19:28:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 4724. [2019-12-18 19:28:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-12-18 19:28:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 15071 transitions. [2019-12-18 19:28:54,183 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 15071 transitions. Word has length 27 [2019-12-18 19:28:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:54,183 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 15071 transitions. [2019-12-18 19:28:54,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:28:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 15071 transitions. [2019-12-18 19:28:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:54,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:54,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:54,187 INFO L410 AbstractCegarLoop]: === Iteration 59 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 552992441, now seen corresponding path program 6 times [2019-12-18 19:28:54,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:54,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943259084] [2019-12-18 19:28:54,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:54,720 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2019-12-18 19:28:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:54,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943259084] [2019-12-18 19:28:54,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:54,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:54,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317745715] [2019-12-18 19:28:54,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:54,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:54,977 INFO L87 Difference]: Start difference. First operand 4724 states and 15071 transitions. Second operand 16 states. [2019-12-18 19:28:56,517 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 19:28:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:58,085 INFO L93 Difference]: Finished difference Result 7546 states and 24440 transitions. [2019-12-18 19:28:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:28:58,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:28:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:58,096 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 19:28:58,096 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 19:28:58,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:28:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 19:28:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5914. [2019-12-18 19:28:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2019-12-18 19:28:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 18970 transitions. [2019-12-18 19:28:58,175 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 18970 transitions. Word has length 27 [2019-12-18 19:28:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:58,175 INFO L462 AbstractCegarLoop]: Abstraction has 5914 states and 18970 transitions. [2019-12-18 19:28:58,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:28:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 18970 transitions. [2019-12-18 19:28:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:28:58,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:58,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:58,180 INFO L410 AbstractCegarLoop]: === Iteration 60 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:28:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash 552992435, now seen corresponding path program 5 times [2019-12-18 19:28:58,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:58,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228738611] [2019-12-18 19:28:58,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:58,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228738611] [2019-12-18 19:28:58,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:58,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:28:58,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096733003] [2019-12-18 19:28:58,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:28:58,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:28:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:28:58,846 INFO L87 Difference]: Start difference. First operand 5914 states and 18970 transitions. Second operand 16 states. [2019-12-18 19:29:00,402 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 19:29:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:01,961 INFO L93 Difference]: Finished difference Result 7117 states and 22848 transitions. [2019-12-18 19:29:01,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:29:01,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:29:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:01,972 INFO L225 Difference]: With dead ends: 7117 [2019-12-18 19:29:01,972 INFO L226 Difference]: Without dead ends: 7117 [2019-12-18 19:29:01,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:29:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2019-12-18 19:29:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 4616. [2019-12-18 19:29:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2019-12-18 19:29:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 14747 transitions. [2019-12-18 19:29:02,039 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 14747 transitions. Word has length 27 [2019-12-18 19:29:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:02,039 INFO L462 AbstractCegarLoop]: Abstraction has 4616 states and 14747 transitions. [2019-12-18 19:29:02,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:29:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 14747 transitions. [2019-12-18 19:29:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:02,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:02,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:02,042 INFO L410 AbstractCegarLoop]: === Iteration 61 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689729, now seen corresponding path program 7 times [2019-12-18 19:29:02,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:02,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914243988] [2019-12-18 19:29:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:02,918 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-18 19:29:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:02,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914243988] [2019-12-18 19:29:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:02,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:29:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940494380] [2019-12-18 19:29:02,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:29:02,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:29:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:29:02,991 INFO L87 Difference]: Start difference. First operand 4616 states and 14747 transitions. Second operand 17 states. [2019-12-18 19:29:04,428 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-12-18 19:29:04,701 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 19:29:04,888 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 19:29:05,110 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 19:29:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:06,274 INFO L93 Difference]: Finished difference Result 6084 states and 19651 transitions. [2019-12-18 19:29:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:29:06,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:29:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:06,283 INFO L225 Difference]: With dead ends: 6084 [2019-12-18 19:29:06,283 INFO L226 Difference]: Without dead ends: 6084 [2019-12-18 19:29:06,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:29:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2019-12-18 19:29:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 4544. [2019-12-18 19:29:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-12-18 19:29:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14531 transitions. [2019-12-18 19:29:06,349 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14531 transitions. Word has length 27 [2019-12-18 19:29:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:06,349 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 14531 transitions. [2019-12-18 19:29:06,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:29:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14531 transitions. [2019-12-18 19:29:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:06,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:06,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:06,352 INFO L410 AbstractCegarLoop]: === Iteration 62 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash -311204967, now seen corresponding path program 8 times [2019-12-18 19:29:06,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:06,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606011622] [2019-12-18 19:29:06,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:06,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606011622] [2019-12-18 19:29:06,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:06,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:29:06,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407335425] [2019-12-18 19:29:06,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:29:06,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:29:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:29:06,976 INFO L87 Difference]: Start difference. First operand 4544 states and 14531 transitions. Second operand 16 states. [2019-12-18 19:29:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:09,990 INFO L93 Difference]: Finished difference Result 7354 states and 23864 transitions. [2019-12-18 19:29:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:29:09,990 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:29:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:10,001 INFO L225 Difference]: With dead ends: 7354 [2019-12-18 19:29:10,001 INFO L226 Difference]: Without dead ends: 7354 [2019-12-18 19:29:10,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:29:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2019-12-18 19:29:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 5734. [2019-12-18 19:29:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-12-18 19:29:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 18430 transitions. [2019-12-18 19:29:10,090 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 18430 transitions. Word has length 27 [2019-12-18 19:29:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:10,091 INFO L462 AbstractCegarLoop]: Abstraction has 5734 states and 18430 transitions. [2019-12-18 19:29:10,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:29:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 18430 transitions. [2019-12-18 19:29:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:10,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:10,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:10,095 INFO L410 AbstractCegarLoop]: === Iteration 63 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash -311204973, now seen corresponding path program 6 times [2019-12-18 19:29:10,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:10,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014199074] [2019-12-18 19:29:10,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:10,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014199074] [2019-12-18 19:29:10,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:10,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:29:10,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433176553] [2019-12-18 19:29:10,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:29:10,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:29:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:29:10,753 INFO L87 Difference]: Start difference. First operand 5734 states and 18430 transitions. Second operand 16 states. [2019-12-18 19:29:12,344 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 19:29:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:13,812 INFO L93 Difference]: Finished difference Result 6925 states and 22272 transitions. [2019-12-18 19:29:13,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:29:13,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:29:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:13,823 INFO L225 Difference]: With dead ends: 6925 [2019-12-18 19:29:13,823 INFO L226 Difference]: Without dead ends: 6925 [2019-12-18 19:29:13,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:29:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2019-12-18 19:29:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 4490. [2019-12-18 19:29:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4490 states. [2019-12-18 19:29:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 14369 transitions. [2019-12-18 19:29:13,889 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 14369 transitions. Word has length 27 [2019-12-18 19:29:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:13,889 INFO L462 AbstractCegarLoop]: Abstraction has 4490 states and 14369 transitions. [2019-12-18 19:29:13,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:29:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 14369 transitions. [2019-12-18 19:29:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:13,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:13,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:13,893 INFO L410 AbstractCegarLoop]: === Iteration 64 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 190808577, now seen corresponding path program 9 times [2019-12-18 19:29:13,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:13,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894319840] [2019-12-18 19:29:13,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:14,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894319840] [2019-12-18 19:29:14,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:14,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:29:14,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427628881] [2019-12-18 19:29:14,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:29:14,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:29:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:29:14,734 INFO L87 Difference]: Start difference. First operand 4490 states and 14369 transitions. Second operand 17 states. [2019-12-18 19:29:16,618 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-18 19:29:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:18,446 INFO L93 Difference]: Finished difference Result 6534 states and 21250 transitions. [2019-12-18 19:29:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:29:18,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:29:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:18,457 INFO L225 Difference]: With dead ends: 6534 [2019-12-18 19:29:18,457 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 19:29:18,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:29:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 19:29:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 5500. [2019-12-18 19:29:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5500 states. [2019-12-18 19:29:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5500 states to 5500 states and 17728 transitions. [2019-12-18 19:29:18,530 INFO L78 Accepts]: Start accepts. Automaton has 5500 states and 17728 transitions. Word has length 27 [2019-12-18 19:29:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:18,530 INFO L462 AbstractCegarLoop]: Abstraction has 5500 states and 17728 transitions. [2019-12-18 19:29:18,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:29:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5500 states and 17728 transitions. [2019-12-18 19:29:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:18,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:18,535 INFO L410 AbstractCegarLoop]: === Iteration 65 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:18,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash 190808571, now seen corresponding path program 7 times [2019-12-18 19:29:18,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:18,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564874011] [2019-12-18 19:29:18,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:19,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564874011] [2019-12-18 19:29:19,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:19,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:29:19,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448245078] [2019-12-18 19:29:19,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:29:19,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:29:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:29:19,245 INFO L87 Difference]: Start difference. First operand 5500 states and 17728 transitions. Second operand 17 states. [2019-12-18 19:29:19,642 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-12-18 19:29:20,507 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-18 19:29:20,789 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 19:29:21,129 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-18 19:29:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:23,033 INFO L93 Difference]: Finished difference Result 6534 states and 21105 transitions. [2019-12-18 19:29:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 19:29:23,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 19:29:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:23,043 INFO L225 Difference]: With dead ends: 6534 [2019-12-18 19:29:23,043 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 19:29:23,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:29:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 19:29:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 4310. [2019-12-18 19:29:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4310 states. [2019-12-18 19:29:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 13829 transitions. [2019-12-18 19:29:23,104 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 13829 transitions. Word has length 27 [2019-12-18 19:29:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:23,105 INFO L462 AbstractCegarLoop]: Abstraction has 4310 states and 13829 transitions. [2019-12-18 19:29:23,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:29:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 13829 transitions. [2019-12-18 19:29:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:23,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:23,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:23,108 INFO L410 AbstractCegarLoop]: === Iteration 66 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722431, now seen corresponding path program 10 times [2019-12-18 19:29:23,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:23,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741315648] [2019-12-18 19:29:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:23,625 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-12-18 19:29:23,851 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-12-18 19:29:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:24,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741315648] [2019-12-18 19:29:24,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:24,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:29:24,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977885247] [2019-12-18 19:29:24,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:29:24,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:29:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:29:24,164 INFO L87 Difference]: Start difference. First operand 4310 states and 13829 transitions. Second operand 16 states. [2019-12-18 19:29:25,181 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-18 19:29:25,441 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-18 19:29:25,731 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-18 19:29:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:27,584 INFO L93 Difference]: Finished difference Result 6294 states and 20530 transitions. [2019-12-18 19:29:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:29:27,585 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:29:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:27,596 INFO L225 Difference]: With dead ends: 6294 [2019-12-18 19:29:27,596 INFO L226 Difference]: Without dead ends: 6294 [2019-12-18 19:29:27,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:29:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2019-12-18 19:29:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 5260. [2019-12-18 19:29:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2019-12-18 19:29:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 17008 transitions. [2019-12-18 19:29:27,665 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 17008 transitions. Word has length 27 [2019-12-18 19:29:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:27,665 INFO L462 AbstractCegarLoop]: Abstraction has 5260 states and 17008 transitions. [2019-12-18 19:29:27,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:29:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 17008 transitions. [2019-12-18 19:29:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:27,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:27,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:27,669 INFO L410 AbstractCegarLoop]: === Iteration 67 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:27,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722437, now seen corresponding path program 8 times [2019-12-18 19:29:27,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:27,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193367674] [2019-12-18 19:29:27,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:28,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193367674] [2019-12-18 19:29:28,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:28,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:29:28,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17395585] [2019-12-18 19:29:28,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:29:28,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:29:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:29:28,497 INFO L87 Difference]: Start difference. First operand 5260 states and 17008 transitions. Second operand 16 states. [2019-12-18 19:29:29,632 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 19:29:30,202 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-18 19:29:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:32,008 INFO L93 Difference]: Finished difference Result 5865 states and 18938 transitions. [2019-12-18 19:29:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:29:32,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:29:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:32,017 INFO L225 Difference]: With dead ends: 5865 [2019-12-18 19:29:32,017 INFO L226 Difference]: Without dead ends: 5865 [2019-12-18 19:29:32,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:29:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2019-12-18 19:29:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 4250. [2019-12-18 19:29:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4250 states. [2019-12-18 19:29:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 13649 transitions. [2019-12-18 19:29:32,076 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 13649 transitions. Word has length 27 [2019-12-18 19:29:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:32,076 INFO L462 AbstractCegarLoop]: Abstraction has 4250 states and 13649 transitions. [2019-12-18 19:29:32,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:29:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 13649 transitions. [2019-12-18 19:29:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:32,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:32,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:32,079 INFO L410 AbstractCegarLoop]: === Iteration 68 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 147907303, now seen corresponding path program 11 times [2019-12-18 19:29:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:32,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008739992] [2019-12-18 19:29:32,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:32,729 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2019-12-18 19:29:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008739992] [2019-12-18 19:29:32,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:32,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 19:29:32,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280914054] [2019-12-18 19:29:32,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:29:32,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:29:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:29:32,988 INFO L87 Difference]: Start difference. First operand 4250 states and 13649 transitions. Second operand 18 states. [2019-12-18 19:29:34,143 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-12-18 19:29:35,126 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 19:29:35,297 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 19:29:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:36,395 INFO L93 Difference]: Finished difference Result 6174 states and 20165 transitions. [2019-12-18 19:29:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:29:36,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-12-18 19:29:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:36,405 INFO L225 Difference]: With dead ends: 6174 [2019-12-18 19:29:36,405 INFO L226 Difference]: Without dead ends: 6174 [2019-12-18 19:29:36,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:29:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2019-12-18 19:29:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 5060. [2019-12-18 19:29:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2019-12-18 19:29:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16388 transitions. [2019-12-18 19:29:36,471 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16388 transitions. Word has length 27 [2019-12-18 19:29:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 5060 states and 16388 transitions. [2019-12-18 19:29:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:29:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16388 transitions. [2019-12-18 19:29:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:36,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:36,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:36,476 INFO L410 AbstractCegarLoop]: === Iteration 69 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash 147907297, now seen corresponding path program 9 times [2019-12-18 19:29:36,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:36,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135452883] [2019-12-18 19:29:36,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:37,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135452883] [2019-12-18 19:29:37,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:37,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 19:29:37,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090199041] [2019-12-18 19:29:37,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:29:37,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:29:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:29:37,331 INFO L87 Difference]: Start difference. First operand 5060 states and 16388 transitions. Second operand 18 states. [2019-12-18 19:29:39,432 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 19:29:39,603 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-18 19:29:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:40,706 INFO L93 Difference]: Finished difference Result 5745 states and 18573 transitions. [2019-12-18 19:29:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:29:40,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-12-18 19:29:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:40,715 INFO L225 Difference]: With dead ends: 5745 [2019-12-18 19:29:40,715 INFO L226 Difference]: Without dead ends: 5745 [2019-12-18 19:29:40,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:29:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2019-12-18 19:29:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 4110. [2019-12-18 19:29:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2019-12-18 19:29:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 13209 transitions. [2019-12-18 19:29:40,770 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 13209 transitions. Word has length 27 [2019-12-18 19:29:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:40,770 INFO L462 AbstractCegarLoop]: Abstraction has 4110 states and 13209 transitions. [2019-12-18 19:29:40,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:29:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 13209 transitions. [2019-12-18 19:29:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:29:40,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:40,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:40,773 INFO L410 AbstractCegarLoop]: === Iteration 70 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:29:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash -650922841, now seen corresponding path program 12 times [2019-12-18 19:29:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:40,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435374009] [2019-12-18 19:29:40,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-12-18 19:29:41,338 WARN L209 SmtUtils]: Removed 2 from assertion stack [2019-12-18 19:29:41,339 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:29:41,342 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:29:41,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:29:41 BasicIcfg [2019-12-18 19:29:41,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:29:41,347 INFO L168 Benchmark]: Toolchain (without parser) took 239458.18 ms. Allocated memory was 146.3 MB in the beginning and 795.9 MB in the end (delta: 649.6 MB). Free memory was 102.1 MB in the beginning and 513.9 MB in the end (delta: -411.8 MB). Peak memory consumption was 237.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,348 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 947.21 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 124.8 MB in the end (delta: -23.1 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.54 ms. Allocated memory is still 203.9 MB. Free memory was 124.8 MB in the beginning and 121.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,349 INFO L168 Benchmark]: Boogie Preprocessor took 40.12 ms. Allocated memory is still 203.9 MB. Free memory was 121.4 MB in the beginning and 119.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,352 INFO L168 Benchmark]: RCFGBuilder took 755.21 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 119.4 MB in the beginning and 191.8 MB in the end (delta: -72.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,352 INFO L168 Benchmark]: TraceAbstraction took 237639.93 ms. Allocated memory was 235.4 MB in the beginning and 795.9 MB in the end (delta: 560.5 MB). Free memory was 191.8 MB in the beginning and 513.9 MB in the end (delta: -322.0 MB). Peak memory consumption was 238.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:41,356 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.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 947.21 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 124.8 MB in the end (delta: -23.1 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.54 ms. Allocated memory is still 203.9 MB. Free memory was 124.8 MB in the beginning and 121.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.12 ms. Allocated memory is still 203.9 MB. Free memory was 121.4 MB in the beginning and 119.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.21 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 119.4 MB in the beginning and 191.8 MB in the end (delta: -72.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237639.93 ms. Allocated memory was 235.4 MB in the beginning and 795.9 MB in the end (delta: 560.5 MB). Free memory was 191.8 MB in the beginning and 513.9 MB in the end (delta: -322.0 MB). Peak memory consumption was 238.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 189 ProgramPointsBefore, 59 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 7 ChoiceCompositions, 8663 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 267 SemBasedMoverChecksPositive, 138 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 27423 CheckedPairsTotal, 166 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 39 for 0ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 39 for 0ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 39 for 0ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 39 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Result: TIMEOUT, OverallTime: 237.4s, OverallIterations: 70, TraceHistogramMax: 1, AutomataDifference: 181.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4523 SDtfs, 17839 SDslu, 20048 SDs, 0 SdLazy, 103999 SolverSat, 1523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 103.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1732 GetRequests, 43 SyntacticMatches, 38 SemanticMatches, 1651 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5291 ImplicationChecksByTransitivity, 96.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6316occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 69 MinimizatonAttempts, 76849 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 41.5s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1717 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 69 PerfectInterpolantSequences, 0/0 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