/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:30:03,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:30:03,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:30:03,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:30:03,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:30:03,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:30:03,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:30:03,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:30:03,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:30:03,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:30:03,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:30:03,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:30:03,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:30:03,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:30:03,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:30:03,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:30:03,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:30:03,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:30:03,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:30:03,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:30:03,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:30:03,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:30:03,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:30:03,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:30:03,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:30:03,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:30:03,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:30:03,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:30:03,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:30:03,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:30:03,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:30:03,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:30:03,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:30:03,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:30:03,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:30:03,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:30:03,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:30:03,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:30:03,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:30:04,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:30:04,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:30:04,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:30:04,037 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:30:04,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:30:04,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:30:04,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:30:04,039 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:30:04,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:30:04,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:30:04,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:30:04,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:30:04,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:30:04,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:30:04,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:30:04,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:30:04,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:30:04,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:30:04,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:30:04,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:30:04,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:30:04,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:30:04,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:30:04,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:30:04,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:30:04,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:30:04,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:30:04,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:30:04,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:30:04,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:30:04,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:30:04,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:30:04,339 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:30:04,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-18 15:30:04,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec44e31e/8239868245bb49fda6cda1762caa7e77/FLAG4d504f8c2 [2019-12-18 15:30:04,961 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:30:04,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-18 15:30:04,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec44e31e/8239868245bb49fda6cda1762caa7e77/FLAG4d504f8c2 [2019-12-18 15:30:05,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec44e31e/8239868245bb49fda6cda1762caa7e77 [2019-12-18 15:30:05,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:30:05,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:30:05,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:30:05,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:30:05,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:30:05,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:30:05" (1/1) ... [2019-12-18 15:30:05,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7262690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:05, skipping insertion in model container [2019-12-18 15:30:05,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:30:05" (1/1) ... [2019-12-18 15:30:05,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:30:05,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:30:05,509 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:30:05,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:30:05,956 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:30:05,968 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:30:06,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:30:06,219 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:30:06,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06 WrapperNode [2019-12-18 15:30:06,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:30:06,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:06,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:30:06,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:30:06,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:06,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:30:06,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:30:06,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:30:06,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (1/1) ... [2019-12-18 15:30:06,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:30:06,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:30:06,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:30:06,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:30:06,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (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 15:30:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 15:30:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 15:30:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 15:30:06,561 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 15:30:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:30:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:30:06,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:30:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:30:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 15:30:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:30:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:30:06,567 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 15:30:07,540 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:30:07,540 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 15:30:07,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:07 BoogieIcfgContainer [2019-12-18 15:30:07,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:30:07,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:30:07,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:30:07,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:30:07,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:30:05" (1/3) ... [2019-12-18 15:30:07,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c673bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:07, skipping insertion in model container [2019-12-18 15:30:07,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:06" (2/3) ... [2019-12-18 15:30:07,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c673bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:07, skipping insertion in model container [2019-12-18 15:30:07,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:07" (3/3) ... [2019-12-18 15:30:07,563 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-18 15:30:07,574 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:30:07,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:30:07,584 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 15:30:07,585 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:30:07,647 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,647 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,647 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,648 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,648 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,648 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,649 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,649 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,649 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,649 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,649 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,650 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,650 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,650 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,650 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,650 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,651 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,652 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,652 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,652 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,652 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,652 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,653 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,653 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,654 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,657 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,657 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,657 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,657 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,658 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,658 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,659 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,660 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,660 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,660 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,661 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,662 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,663 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,663 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,663 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,663 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,663 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,664 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,665 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,665 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,665 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,666 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,666 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,666 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,667 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,667 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,668 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,669 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,669 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,670 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,670 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,670 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,670 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,670 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,671 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,672 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,672 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,672 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,672 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,672 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,673 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,673 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,673 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,673 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,673 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,674 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,674 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,676 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,676 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,676 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,676 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,677 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,680 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,681 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,681 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,681 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,685 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,685 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,685 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,685 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,686 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,688 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,688 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,688 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,688 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,689 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,690 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,690 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,690 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,690 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,690 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,691 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,695 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,695 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,696 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,696 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,696 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,696 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,696 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,697 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,697 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,697 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,697 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,697 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,698 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,699 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,699 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,699 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,699 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,699 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,700 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,700 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,700 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,701 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,702 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,702 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,702 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,702 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,702 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,703 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,704 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,705 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,706 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,707 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,708 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,709 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,710 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,710 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,710 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,710 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,710 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,711 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,717 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,718 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,718 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,718 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,718 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,718 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,719 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,719 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,719 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,719 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,719 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,720 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,720 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,720 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,720 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,720 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,721 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,721 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,726 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,727 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,727 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,727 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,727 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,727 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,728 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,729 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,729 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,729 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,729 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,729 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,730 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,730 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,730 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,730 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,730 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,731 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,731 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,731 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,731 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,731 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,732 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,733 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,733 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:07,753 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 15:30:07,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:30:07,774 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:30:07,774 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:30:07,774 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:30:07,775 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:30:07,775 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:30:07,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:30:07,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:30:07,800 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-18 15:30:07,802 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 15:30:07,916 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 15:30:07,916 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:07,938 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 19/187 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-18 15:30:07,960 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 15:30:08,017 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 15:30:08,017 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:08,026 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 19/187 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-18 15:30:08,045 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-18 15:30:08,046 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:30:08,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:08,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:08,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:08,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:08,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:12,099 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-18 15:30:12,286 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-18 15:30:12,428 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-18 15:30:12,698 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2019-12-18 15:30:12,698 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2019-12-18 15:30:12,702 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-18 15:30:12,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-18 15:30:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-18 15:30:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:30:12,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:12,842 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 15:30:12,842 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2019-12-18 15:30:12,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:12,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157184403] [2019-12-18 15:30:12,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:13,395 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 15:30:13,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157184403] [2019-12-18 15:30:13,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:13,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:30:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599072556] [2019-12-18 15:30:13,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:30:13,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:30:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:30:13,424 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-18 15:30:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:13,786 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-18 15:30:13,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:30:13,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 15:30:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:13,826 INFO L225 Difference]: With dead ends: 2169 [2019-12-18 15:30:13,826 INFO L226 Difference]: Without dead ends: 2053 [2019-12-18 15:30:13,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:30:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-18 15:30:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-18 15:30:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-18 15:30:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-18 15:30:14,006 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-18 15:30:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:14,006 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-18 15:30:14,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:30:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-18 15:30:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:14,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:14,010 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 15:30:14,010 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2019-12-18 15:30:14,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:14,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977148934] [2019-12-18 15:30:14,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:14,202 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 15:30:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977148934] [2019-12-18 15:30:14,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:14,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:30:14,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761699911] [2019-12-18 15:30:14,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:30:14,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:30:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:30:14,206 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-18 15:30:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:14,866 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2019-12-18 15:30:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:30:14,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 15:30:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:14,890 INFO L225 Difference]: With dead ends: 2588 [2019-12-18 15:30:14,891 INFO L226 Difference]: Without dead ends: 2544 [2019-12-18 15:30:14,892 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 15:30:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-18 15:30:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2019-12-18 15:30:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-18 15:30:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-18 15:30:15,063 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-18 15:30:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:15,064 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-18 15:30:15,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:30:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-18 15:30:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:15,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:15,070 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 15:30:15,070 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2019-12-18 15:30:15,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:15,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585710829] [2019-12-18 15:30:15,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:15,685 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 15:30:15,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585710829] [2019-12-18 15:30:15,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:15,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:15,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932832052] [2019-12-18 15:30:15,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:15,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:15,688 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 14 states. [2019-12-18 15:30:16,649 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 15:30:17,471 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:30:17,667 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-18 15:30:17,958 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-18 15:30:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:18,207 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2019-12-18 15:30:18,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:30:18,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:18,231 INFO L225 Difference]: With dead ends: 3164 [2019-12-18 15:30:18,231 INFO L226 Difference]: Without dead ends: 3164 [2019-12-18 15:30:18,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:30:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-12-18 15:30:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2019-12-18 15:30:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-18 15:30:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2019-12-18 15:30:18,395 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2019-12-18 15:30:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:18,396 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2019-12-18 15:30:18,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2019-12-18 15:30:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:18,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:18,408 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 15:30:18,408 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2019-12-18 15:30:18,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:18,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476718018] [2019-12-18 15:30:18,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:18,907 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 15:30:18,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476718018] [2019-12-18 15:30:18,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:18,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:30:18,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992992128] [2019-12-18 15:30:18,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:30:18,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:30:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:30:18,909 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 12 states. [2019-12-18 15:30:20,539 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-18 15:30:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:20,798 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2019-12-18 15:30:20,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:20,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 15:30:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:20,825 INFO L225 Difference]: With dead ends: 3654 [2019-12-18 15:30:20,825 INFO L226 Difference]: Without dead ends: 3654 [2019-12-18 15:30:20,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:30:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-18 15:30:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-18 15:30:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-18 15:30:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-18 15:30:20,930 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-18 15:30:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-18 15:30:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:30:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-18 15:30:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:20,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:20,939 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 15:30:20,939 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2019-12-18 15:30:20,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:20,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679886048] [2019-12-18 15:30:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:21,547 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 15:30:21,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679886048] [2019-12-18 15:30:21,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:21,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:21,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776096624] [2019-12-18 15:30:21,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:21,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:21,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:21,550 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 14 states. [2019-12-18 15:30:22,236 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-12-18 15:30:24,118 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 15:30:24,412 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 15:30:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:24,740 INFO L93 Difference]: Finished difference Result 5414 states and 17426 transitions. [2019-12-18 15:30:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:30:24,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:24,776 INFO L225 Difference]: With dead ends: 5414 [2019-12-18 15:30:24,776 INFO L226 Difference]: Without dead ends: 5414 [2019-12-18 15:30:24,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:30:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-12-18 15:30:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3844. [2019-12-18 15:30:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-18 15:30:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 12546 transitions. [2019-12-18 15:30:24,888 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 12546 transitions. Word has length 25 [2019-12-18 15:30:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:24,889 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 12546 transitions. [2019-12-18 15:30:24,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 12546 transitions. [2019-12-18 15:30:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:24,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:24,897 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 15:30:24,897 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2019-12-18 15:30:24,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:24,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677150275] [2019-12-18 15:30:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:25,430 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 15:30:25,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677150275] [2019-12-18 15:30:25,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:25,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:25,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577797064] [2019-12-18 15:30:25,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:25,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:25,432 INFO L87 Difference]: Start difference. First operand 3844 states and 12546 transitions. Second operand 13 states. [2019-12-18 15:30:27,136 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-18 15:30:28,630 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-18 15:30:28,969 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-18 15:30:29,146 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-18 15:30:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:29,532 INFO L93 Difference]: Finished difference Result 4818 states and 15403 transitions. [2019-12-18 15:30:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:30:29,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:29,548 INFO L225 Difference]: With dead ends: 4818 [2019-12-18 15:30:29,548 INFO L226 Difference]: Without dead ends: 4818 [2019-12-18 15:30:29,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:30:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2019-12-18 15:30:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3188. [2019-12-18 15:30:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-18 15:30:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-18 15:30:29,641 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-18 15:30:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:29,642 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-18 15:30:29,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-18 15:30:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:29,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:29,648 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 15:30:29,648 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2019-12-18 15:30:29,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:29,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30143298] [2019-12-18 15:30:29,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:30,206 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 15:30:30,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30143298] [2019-12-18 15:30:30,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:30,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:30,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706976070] [2019-12-18 15:30:30,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:30,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:30,209 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 13 states. [2019-12-18 15:30:32,965 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-18 15:30:33,195 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-18 15:30:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:33,545 INFO L93 Difference]: Finished difference Result 4168 states and 13116 transitions. [2019-12-18 15:30:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:30:33,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:33,559 INFO L225 Difference]: With dead ends: 4168 [2019-12-18 15:30:33,560 INFO L226 Difference]: Without dead ends: 4168 [2019-12-18 15:30:33,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:30:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-12-18 15:30:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3188. [2019-12-18 15:30:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-18 15:30:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10166 transitions. [2019-12-18 15:30:33,653 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10166 transitions. Word has length 25 [2019-12-18 15:30:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:33,654 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10166 transitions. [2019-12-18 15:30:33,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10166 transitions. [2019-12-18 15:30:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:33,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:33,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] [2019-12-18 15:30:33,662 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1997301412, now seen corresponding path program 3 times [2019-12-18 15:30:33,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:33,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142999394] [2019-12-18 15:30:33,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:34,155 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 15:30:34,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142999394] [2019-12-18 15:30:34,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:34,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:34,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238779980] [2019-12-18 15:30:34,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:34,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:34,158 INFO L87 Difference]: Start difference. First operand 3188 states and 10166 transitions. Second operand 13 states. [2019-12-18 15:30:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:36,758 INFO L93 Difference]: Finished difference Result 3972 states and 12550 transitions. [2019-12-18 15:30:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:36,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:36,767 INFO L225 Difference]: With dead ends: 3972 [2019-12-18 15:30:36,768 INFO L226 Difference]: Without dead ends: 3972 [2019-12-18 15:30:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2019-12-18 15:30:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2852. [2019-12-18 15:30:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-18 15:30:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-18 15:30:36,845 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-18 15:30:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:36,845 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-18 15:30:36,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-18 15:30:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:36,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:36,851 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 15:30:36,851 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:36,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2019-12-18 15:30:36,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:36,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850304822] [2019-12-18 15:30:36,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:37,587 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 15:30:37,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850304822] [2019-12-18 15:30:37,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:37,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:37,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437340298] [2019-12-18 15:30:37,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:37,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:37,589 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 16 states. [2019-12-18 15:30:38,697 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 15:30:38,950 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 15:30:39,325 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-18 15:30:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:40,779 INFO L93 Difference]: Finished difference Result 5092 states and 16416 transitions. [2019-12-18 15:30:40,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:40,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:30:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:40,791 INFO L225 Difference]: With dead ends: 5092 [2019-12-18 15:30:40,791 INFO L226 Difference]: Without dead ends: 5092 [2019-12-18 15:30:40,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2019-12-18 15:30:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4102. [2019-12-18 15:30:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-18 15:30:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13138 transitions. [2019-12-18 15:30:40,910 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13138 transitions. Word has length 27 [2019-12-18 15:30:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:40,910 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13138 transitions. [2019-12-18 15:30:40,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:30:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13138 transitions. [2019-12-18 15:30:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:40,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:40,919 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 15:30:40,919 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512479, now seen corresponding path program 1 times [2019-12-18 15:30:40,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:40,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750926333] [2019-12-18 15:30:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:41,532 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2019-12-18 15:30:41,747 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 15:30:41,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750926333] [2019-12-18 15:30:41,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:41,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:41,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14241239] [2019-12-18 15:30:41,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:41,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:41,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:41,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:41,749 INFO L87 Difference]: Start difference. First operand 4102 states and 13138 transitions. Second operand 16 states. [2019-12-18 15:30:43,221 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 15:30:43,494 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 15:30:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:44,834 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2019-12-18 15:30:44,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:44,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:30:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:44,843 INFO L225 Difference]: With dead ends: 5017 [2019-12-18 15:30:44,843 INFO L226 Difference]: Without dead ends: 5017 [2019-12-18 15:30:44,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-12-18 15:30:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2019-12-18 15:30:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-18 15:30:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2019-12-18 15:30:44,932 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2019-12-18 15:30:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:44,932 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2019-12-18 15:30:44,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:30:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2019-12-18 15:30:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:44,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:44,941 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 15:30:44,941 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2019-12-18 15:30:44,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:44,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614459401] [2019-12-18 15:30:44,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:45,433 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2019-12-18 15:30:45,653 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 15:30:45,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614459401] [2019-12-18 15:30:45,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:45,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:45,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944762357] [2019-12-18 15:30:45,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:30:45,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:30:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:30:45,656 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 15 states. [2019-12-18 15:30:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:48,446 INFO L93 Difference]: Finished difference Result 6137 states and 19825 transitions. [2019-12-18 15:30:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:30:48,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:30:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:48,457 INFO L225 Difference]: With dead ends: 6137 [2019-12-18 15:30:48,457 INFO L226 Difference]: Without dead ends: 6137 [2019-12-18 15:30:48,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:30:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-18 15:30:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5222. [2019-12-18 15:30:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-18 15:30:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 16711 transitions. [2019-12-18 15:30:48,560 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 16711 transitions. Word has length 27 [2019-12-18 15:30:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:48,560 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 16711 transitions. [2019-12-18 15:30:48,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:30:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 16711 transitions. [2019-12-18 15:30:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:48,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:48,568 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 15:30:48,568 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:48,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash 363501540, now seen corresponding path program 1 times [2019-12-18 15:30:48,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:48,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002874753] [2019-12-18 15:30:48,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:49,179 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 15:30:49,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002874753] [2019-12-18 15:30:49,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:49,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:49,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223019555] [2019-12-18 15:30:49,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:49,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:49,181 INFO L87 Difference]: Start difference. First operand 5222 states and 16711 transitions. Second operand 14 states. [2019-12-18 15:30:50,264 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-12-18 15:30:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:51,540 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-18 15:30:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:30:51,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-18 15:30:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:51,550 INFO L225 Difference]: With dead ends: 6137 [2019-12-18 15:30:51,550 INFO L226 Difference]: Without dead ends: 6137 [2019-12-18 15:30:51,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:30:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-18 15:30:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-18 15:30:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-18 15:30:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-18 15:30:51,657 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-18 15:30:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:51,657 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-18 15:30:51,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-18 15:30:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:51,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:51,668 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 15:30:51,668 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2019-12-18 15:30:51,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:51,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592155638] [2019-12-18 15:30:51,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:52,358 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 15:30:52,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592155638] [2019-12-18 15:30:52,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:52,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:52,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541060428] [2019-12-18 15:30:52,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:30:52,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:30:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:30:52,361 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 15 states. [2019-12-18 15:30:53,487 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-12-18 15:30:53,784 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-18 15:30:54,099 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-12-18 15:30:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:55,810 INFO L93 Difference]: Finished difference Result 7404 states and 23605 transitions. [2019-12-18 15:30:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:55,811 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:30:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:55,824 INFO L225 Difference]: With dead ends: 7404 [2019-12-18 15:30:55,825 INFO L226 Difference]: Without dead ends: 7404 [2019-12-18 15:30:55,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:30:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2019-12-18 15:30:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 5934. [2019-12-18 15:30:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-12-18 15:30:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 18887 transitions. [2019-12-18 15:30:55,956 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 18887 transitions. Word has length 27 [2019-12-18 15:30:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:55,956 INFO L462 AbstractCegarLoop]: Abstraction has 5934 states and 18887 transitions. [2019-12-18 15:30:55,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:30:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 18887 transitions. [2019-12-18 15:30:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:30:55,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:55,970 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 15:30:55,970 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139073, now seen corresponding path program 2 times [2019-12-18 15:30:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:55,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357965941] [2019-12-18 15:30:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:56,517 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-12-18 15:30:56,791 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 15:30:56,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357965941] [2019-12-18 15:30:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:56,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386643237] [2019-12-18 15:30:56,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:56,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:56,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:56,792 INFO L87 Difference]: Start difference. First operand 5934 states and 18887 transitions. Second operand 16 states. [2019-12-18 15:30:57,994 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-12-18 15:30:58,307 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 15:30:58,706 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 15:31:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:00,464 INFO L93 Difference]: Finished difference Result 7329 states and 23321 transitions. [2019-12-18 15:31:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:00,464 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:00,475 INFO L225 Difference]: With dead ends: 7329 [2019-12-18 15:31:00,475 INFO L226 Difference]: Without dead ends: 7329 [2019-12-18 15:31:00,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-18 15:31:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4804. [2019-12-18 15:31:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 15:31:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 15:31:00,578 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 15:31:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:00,578 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 15:31:00,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 15:31:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:00,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:00,589 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 15:31:00,589 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2019-12-18 15:31:00,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:00,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209882761] [2019-12-18 15:31:00,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:01,047 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-12-18 15:31:01,235 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-12-18 15:31:01,511 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 15:31:01,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209882761] [2019-12-18 15:31:01,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:01,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:01,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215014300] [2019-12-18 15:31:01,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:01,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:01,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:01,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:01,513 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-18 15:31:02,619 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 15:31:02,917 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-18 15:31:03,273 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-18 15:31:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:05,152 INFO L93 Difference]: Finished difference Result 6814 states and 21845 transitions. [2019-12-18 15:31:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:05,153 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:05,164 INFO L225 Difference]: With dead ends: 6814 [2019-12-18 15:31:05,164 INFO L226 Difference]: Without dead ends: 6814 [2019-12-18 15:31:05,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2019-12-18 15:31:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5754. [2019-12-18 15:31:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5754 states. [2019-12-18 15:31:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 18347 transitions. [2019-12-18 15:31:05,276 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 18347 transitions. Word has length 27 [2019-12-18 15:31:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:05,276 INFO L462 AbstractCegarLoop]: Abstraction has 5754 states and 18347 transitions. [2019-12-18 15:31:05,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 18347 transitions. [2019-12-18 15:31:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:05,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:05,285 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 15:31:05,286 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227083, now seen corresponding path program 3 times [2019-12-18 15:31:05,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:05,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100145184] [2019-12-18 15:31:05,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:06,028 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 15:31:06,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100145184] [2019-12-18 15:31:06,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:06,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:06,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343932220] [2019-12-18 15:31:06,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:06,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:06,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:06,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:06,030 INFO L87 Difference]: Start difference. First operand 5754 states and 18347 transitions. Second operand 16 states. [2019-12-18 15:31:07,440 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-18 15:31:07,788 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 15:31:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:09,674 INFO L93 Difference]: Finished difference Result 6739 states and 21561 transitions. [2019-12-18 15:31:09,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:09,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:09,684 INFO L225 Difference]: With dead ends: 6739 [2019-12-18 15:31:09,684 INFO L226 Difference]: Without dead ends: 6739 [2019-12-18 15:31:09,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2019-12-18 15:31:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4804. [2019-12-18 15:31:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 15:31:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 15:31:09,783 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 15:31:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:09,784 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 15:31:09,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 15:31:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:09,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:09,790 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 15:31:09,790 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2019-12-18 15:31:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:09,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486929892] [2019-12-18 15:31:09,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:10,469 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 15:31:10,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486929892] [2019-12-18 15:31:10,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:10,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:10,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184614381] [2019-12-18 15:31:10,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:10,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:10,471 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-18 15:31:11,770 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-18 15:31:12,152 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 15:31:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:14,116 INFO L93 Difference]: Finished difference Result 6619 states and 21201 transitions. [2019-12-18 15:31:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:31:14,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:14,125 INFO L225 Difference]: With dead ends: 6619 [2019-12-18 15:31:14,125 INFO L226 Difference]: Without dead ends: 6619 [2019-12-18 15:31:14,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:31:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-18 15:31:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4804. [2019-12-18 15:31:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 15:31:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 15:31:14,198 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 15:31:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:14,198 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 15:31:14,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 15:31:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:14,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:14,204 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 15:31:14,204 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2019-12-18 15:31:14,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:14,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353232214] [2019-12-18 15:31:14,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:14,669 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-12-18 15:31:14,949 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 15:31:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353232214] [2019-12-18 15:31:14,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:14,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:14,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841660514] [2019-12-18 15:31:14,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:14,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:14,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:14,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:14,950 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-18 15:31:16,324 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:31:16,462 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-12-18 15:31:16,776 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-18 15:31:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:19,110 INFO L93 Difference]: Finished difference Result 8562 states and 27805 transitions. [2019-12-18 15:31:19,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:31:19,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:19,123 INFO L225 Difference]: With dead ends: 8562 [2019-12-18 15:31:19,123 INFO L226 Difference]: Without dead ends: 8562 [2019-12-18 15:31:19,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:31:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-18 15:31:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 5539. [2019-12-18 15:31:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2019-12-18 15:31:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 17692 transitions. [2019-12-18 15:31:19,214 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 17692 transitions. Word has length 27 [2019-12-18 15:31:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:19,215 INFO L462 AbstractCegarLoop]: Abstraction has 5539 states and 17692 transitions. [2019-12-18 15:31:19,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 17692 transitions. [2019-12-18 15:31:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:19,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:19,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 15:31:19,223 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash 471322491, now seen corresponding path program 4 times [2019-12-18 15:31:19,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:19,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233290311] [2019-12-18 15:31:19,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:19,760 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-12-18 15:31:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:20,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233290311] [2019-12-18 15:31:20,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:20,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:20,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262709250] [2019-12-18 15:31:20,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:20,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:20,060 INFO L87 Difference]: Start difference. First operand 5539 states and 17692 transitions. Second operand 16 states. [2019-12-18 15:31:21,250 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-18 15:31:21,646 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 15:31:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:23,722 INFO L93 Difference]: Finished difference Result 8562 states and 27685 transitions. [2019-12-18 15:31:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:31:23,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:23,734 INFO L225 Difference]: With dead ends: 8562 [2019-12-18 15:31:23,734 INFO L226 Difference]: Without dead ends: 8562 [2019-12-18 15:31:23,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:31:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-18 15:31:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 4849. [2019-12-18 15:31:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-18 15:31:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-18 15:31:23,813 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-18 15:31:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:23,814 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-18 15:31:23,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-18 15:31:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:23,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:23,819 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 15:31:23,820 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:23,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash -869839874, now seen corresponding path program 6 times [2019-12-18 15:31:23,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:23,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215511279] [2019-12-18 15:31:23,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:24,429 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-12-18 15:31:24,744 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 15:31:24,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215511279] [2019-12-18 15:31:24,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:24,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:24,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083126265] [2019-12-18 15:31:24,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:24,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:24,747 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-18 15:31:25,621 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-12-18 15:31:26,364 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 15:31:26,696 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:31:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:28,460 INFO L93 Difference]: Finished difference Result 7194 states and 23046 transitions. [2019-12-18 15:31:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:31:28,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:28,517 INFO L225 Difference]: With dead ends: 7194 [2019-12-18 15:31:28,518 INFO L226 Difference]: Without dead ends: 7194 [2019-12-18 15:31:28,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:31:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-18 15:31:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 6159. [2019-12-18 15:31:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6159 states. [2019-12-18 15:31:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6159 states to 6159 states and 19572 transitions. [2019-12-18 15:31:28,597 INFO L78 Accepts]: Start accepts. Automaton has 6159 states and 19572 transitions. Word has length 27 [2019-12-18 15:31:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:28,597 INFO L462 AbstractCegarLoop]: Abstraction has 6159 states and 19572 transitions. [2019-12-18 15:31:28,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6159 states and 19572 transitions. [2019-12-18 15:31:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:28,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:28,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:28,605 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash -869839873, now seen corresponding path program 5 times [2019-12-18 15:31:28,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:28,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809298854] [2019-12-18 15:31:28,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:29,378 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 15:31:29,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809298854] [2019-12-18 15:31:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:29,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:29,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215909013] [2019-12-18 15:31:29,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:29,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:29,380 INFO L87 Difference]: Start difference. First operand 6159 states and 19572 transitions. Second operand 16 states. [2019-12-18 15:31:30,994 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-12-18 15:31:31,355 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 15:31:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:33,103 INFO L93 Difference]: Finished difference Result 7194 states and 22926 transitions. [2019-12-18 15:31:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:31:33,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:33,114 INFO L225 Difference]: With dead ends: 7194 [2019-12-18 15:31:33,115 INFO L226 Difference]: Without dead ends: 7194 [2019-12-18 15:31:33,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:31:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-18 15:31:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 4849. [2019-12-18 15:31:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-18 15:31:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-18 15:31:33,185 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-18 15:31:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:33,186 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-18 15:31:33,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-18 15:31:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:33,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:33,192 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 15:31:33,193 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2019-12-18 15:31:33,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:33,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027210155] [2019-12-18 15:31:33,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:33,663 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-18 15:31:33,876 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-12-18 15:31:34,111 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 15:31:34,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027210155] [2019-12-18 15:31:34,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:34,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:34,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731364085] [2019-12-18 15:31:34,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:34,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:34,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:34,113 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-18 15:31:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:37,423 INFO L93 Difference]: Finished difference Result 7028 states and 22548 transitions. [2019-12-18 15:31:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:37,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:37,433 INFO L225 Difference]: With dead ends: 7028 [2019-12-18 15:31:37,434 INFO L226 Difference]: Without dead ends: 7028 [2019-12-18 15:31:37,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-18 15:31:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6003. [2019-12-18 15:31:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2019-12-18 15:31:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19104 transitions. [2019-12-18 15:31:37,517 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19104 transitions. Word has length 27 [2019-12-18 15:31:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:37,517 INFO L462 AbstractCegarLoop]: Abstraction has 6003 states and 19104 transitions. [2019-12-18 15:31:37,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19104 transitions. [2019-12-18 15:31:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:37,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:37,523 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 15:31:37,523 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 2 times [2019-12-18 15:31:37,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:37,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293048392] [2019-12-18 15:31:37,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:38,209 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 15:31:38,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293048392] [2019-12-18 15:31:38,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:38,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:38,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577811893] [2019-12-18 15:31:38,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:38,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:38,211 INFO L87 Difference]: Start difference. First operand 6003 states and 19104 transitions. Second operand 16 states. [2019-12-18 15:31:39,824 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-12-18 15:31:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:41,655 INFO L93 Difference]: Finished difference Result 7028 states and 22428 transitions. [2019-12-18 15:31:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:41,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:41,668 INFO L225 Difference]: With dead ends: 7028 [2019-12-18 15:31:41,668 INFO L226 Difference]: Without dead ends: 7028 [2019-12-18 15:31:41,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-18 15:31:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4733. [2019-12-18 15:31:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-18 15:31:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-18 15:31:41,747 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-18 15:31:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:41,747 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-18 15:31:41,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-18 15:31:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:41,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:41,752 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 15:31:41,752 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2019-12-18 15:31:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:41,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599433745] [2019-12-18 15:31:41,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:42,395 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 15:31:42,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599433745] [2019-12-18 15:31:42,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:42,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:42,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847024789] [2019-12-18 15:31:42,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:42,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:42,397 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-18 15:31:43,623 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 15:31:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:45,325 INFO L93 Difference]: Finished difference Result 6548 states and 20998 transitions. [2019-12-18 15:31:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:45,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:45,335 INFO L225 Difference]: With dead ends: 6548 [2019-12-18 15:31:45,336 INFO L226 Difference]: Without dead ends: 6548 [2019-12-18 15:31:45,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-12-18 15:31:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 4733. [2019-12-18 15:31:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-18 15:31:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-18 15:31:45,416 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-18 15:31:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:45,416 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-18 15:31:45,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-18 15:31:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:45,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:45,421 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 15:31:45,421 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2019-12-18 15:31:45,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:45,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052635011] [2019-12-18 15:31:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:46,062 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 15:31:46,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052635011] [2019-12-18 15:31:46,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:46,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:46,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444277930] [2019-12-18 15:31:46,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:46,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:46,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:46,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:46,063 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-18 15:31:47,344 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 15:31:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:49,414 INFO L93 Difference]: Finished difference Result 8491 states and 27602 transitions. [2019-12-18 15:31:49,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:31:49,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:49,432 INFO L225 Difference]: With dead ends: 8491 [2019-12-18 15:31:49,433 INFO L226 Difference]: Without dead ends: 8491 [2019-12-18 15:31:49,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-18 15:31:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 5468. [2019-12-18 15:31:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-12-18 15:31:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 17489 transitions. [2019-12-18 15:31:49,531 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 17489 transitions. Word has length 27 [2019-12-18 15:31:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:49,531 INFO L462 AbstractCegarLoop]: Abstraction has 5468 states and 17489 transitions. [2019-12-18 15:31:49,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 17489 transitions. [2019-12-18 15:31:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:49,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:49,537 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 15:31:49,538 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665118, now seen corresponding path program 3 times [2019-12-18 15:31:49,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:49,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860386928] [2019-12-18 15:31:49,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:49,964 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-12-18 15:31:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:50,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860386928] [2019-12-18 15:31:50,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:50,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:50,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353669101] [2019-12-18 15:31:50,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:50,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:50,249 INFO L87 Difference]: Start difference. First operand 5468 states and 17489 transitions. Second operand 15 states. [2019-12-18 15:31:51,587 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-18 15:31:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:53,542 INFO L93 Difference]: Finished difference Result 8491 states and 27482 transitions. [2019-12-18 15:31:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:31:53,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:53,555 INFO L225 Difference]: With dead ends: 8491 [2019-12-18 15:31:53,555 INFO L226 Difference]: Without dead ends: 8491 [2019-12-18 15:31:53,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-18 15:31:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4739. [2019-12-18 15:31:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 15:31:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-18 15:31:53,638 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-18 15:31:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:53,638 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-18 15:31:53,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-18 15:31:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:53,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:53,643 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 15:31:53,643 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2019-12-18 15:31:53,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:53,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775512541] [2019-12-18 15:31:53,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:54,335 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 15:31:54,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775512541] [2019-12-18 15:31:54,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:54,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:54,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606771422] [2019-12-18 15:31:54,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:54,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:54,337 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-18 15:31:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:57,137 INFO L93 Difference]: Finished difference Result 6594 states and 21247 transitions. [2019-12-18 15:31:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:57,137 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:57,147 INFO L225 Difference]: With dead ends: 6594 [2019-12-18 15:31:57,147 INFO L226 Difference]: Without dead ends: 6594 [2019-12-18 15:31:57,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-18 15:31:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 5679. [2019-12-18 15:31:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-12-18 15:31:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 18133 transitions. [2019-12-18 15:31:57,224 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 18133 transitions. Word has length 27 [2019-12-18 15:31:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:57,224 INFO L462 AbstractCegarLoop]: Abstraction has 5679 states and 18133 transitions. [2019-12-18 15:31:57,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 18133 transitions. [2019-12-18 15:31:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:57,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:57,229 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 15:31:57,230 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash 14057406, now seen corresponding path program 4 times [2019-12-18 15:31:57,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:57,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763798631] [2019-12-18 15:31:57,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:57,674 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-18 15:31:57,860 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-18 15:31:58,103 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 15:31:58,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763798631] [2019-12-18 15:31:58,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:58,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:58,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898350638] [2019-12-18 15:31:58,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:58,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:58,105 INFO L87 Difference]: Start difference. First operand 5679 states and 18133 transitions. Second operand 15 states. [2019-12-18 15:32:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:01,334 INFO L93 Difference]: Finished difference Result 6594 states and 21127 transitions. [2019-12-18 15:32:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:01,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:01,343 INFO L225 Difference]: With dead ends: 6594 [2019-12-18 15:32:01,344 INFO L226 Difference]: Without dead ends: 6594 [2019-12-18 15:32:01,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-18 15:32:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4739. [2019-12-18 15:32:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 15:32:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-18 15:32:01,410 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-18 15:32:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:01,410 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-18 15:32:01,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-18 15:32:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:01,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:01,414 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 15:32:01,414 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775101, now seen corresponding path program 6 times [2019-12-18 15:32:01,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:01,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463254594] [2019-12-18 15:32:01,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:02,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463254594] [2019-12-18 15:32:02,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:02,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:02,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318295140] [2019-12-18 15:32:02,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:02,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:02,066 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-18 15:32:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:04,883 INFO L93 Difference]: Finished difference Result 6784 states and 21797 transitions. [2019-12-18 15:32:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:04,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:04,893 INFO L225 Difference]: With dead ends: 6784 [2019-12-18 15:32:04,893 INFO L226 Difference]: Without dead ends: 6784 [2019-12-18 15:32:04,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-18 15:32:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 5429. [2019-12-18 15:32:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2019-12-18 15:32:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 17363 transitions. [2019-12-18 15:32:04,965 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 17363 transitions. Word has length 27 [2019-12-18 15:32:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:04,965 INFO L462 AbstractCegarLoop]: Abstraction has 5429 states and 17363 transitions. [2019-12-18 15:32:04,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 17363 transitions. [2019-12-18 15:32:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:04,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:04,970 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 15:32:04,970 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775100, now seen corresponding path program 5 times [2019-12-18 15:32:04,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:04,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977849012] [2019-12-18 15:32:04,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:05,483 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-12-18 15:32:05,719 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 15:32:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977849012] [2019-12-18 15:32:05,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:05,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:05,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925666241] [2019-12-18 15:32:05,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:05,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:05,721 INFO L87 Difference]: Start difference. First operand 5429 states and 17363 transitions. Second operand 15 states. [2019-12-18 15:32:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:08,680 INFO L93 Difference]: Finished difference Result 6784 states and 21677 transitions. [2019-12-18 15:32:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:08,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:08,690 INFO L225 Difference]: With dead ends: 6784 [2019-12-18 15:32:08,691 INFO L226 Difference]: Without dead ends: 6784 [2019-12-18 15:32:08,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-18 15:32:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 4049. [2019-12-18 15:32:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-18 15:32:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12935 transitions. [2019-12-18 15:32:08,803 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12935 transitions. Word has length 27 [2019-12-18 15:32:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:08,803 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12935 transitions. [2019-12-18 15:32:08,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12935 transitions. [2019-12-18 15:32:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:08,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:08,808 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 15:32:08,809 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907358, now seen corresponding path program 7 times [2019-12-18 15:32:08,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:08,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636256042] [2019-12-18 15:32:08,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:09,460 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 15:32:09,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636256042] [2019-12-18 15:32:09,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:09,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:09,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146251291] [2019-12-18 15:32:09,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:09,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:09,463 INFO L87 Difference]: Start difference. First operand 4049 states and 12935 transitions. Second operand 15 states. [2019-12-18 15:32:10,553 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 15:32:10,843 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-18 15:32:11,129 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-12-18 15:32:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:12,629 INFO L93 Difference]: Finished difference Result 6029 states and 19451 transitions. [2019-12-18 15:32:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:12,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:12,639 INFO L225 Difference]: With dead ends: 6029 [2019-12-18 15:32:12,639 INFO L226 Difference]: Without dead ends: 6029 [2019-12-18 15:32:12,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:32:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2019-12-18 15:32:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 4739. [2019-12-18 15:32:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 15:32:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15273 transitions. [2019-12-18 15:32:12,709 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15273 transitions. Word has length 27 [2019-12-18 15:32:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:12,709 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15273 transitions. [2019-12-18 15:32:12,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15273 transitions. [2019-12-18 15:32:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:12,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:12,713 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 15:32:12,713 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907357, now seen corresponding path program 6 times [2019-12-18 15:32:12,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:12,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445522874] [2019-12-18 15:32:12,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:13,195 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-12-18 15:32:13,456 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 15:32:13,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445522874] [2019-12-18 15:32:13,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:13,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:13,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333146855] [2019-12-18 15:32:13,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:13,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:13,457 INFO L87 Difference]: Start difference. First operand 4739 states and 15273 transitions. Second operand 16 states. [2019-12-18 15:32:14,825 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 15:32:15,121 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 15:32:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:16,722 INFO L93 Difference]: Finished difference Result 5954 states and 19167 transitions. [2019-12-18 15:32:16,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:16,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:16,730 INFO L225 Difference]: With dead ends: 5954 [2019-12-18 15:32:16,731 INFO L226 Difference]: Without dead ends: 5954 [2019-12-18 15:32:16,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-18 15:32:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3549. [2019-12-18 15:32:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-18 15:32:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-18 15:32:16,789 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-18 15:32:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:16,790 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-18 15:32:16,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-18 15:32:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:16,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:16,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:16,793 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2019-12-18 15:32:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:16,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769694951] [2019-12-18 15:32:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:17,935 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 15:32:17,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769694951] [2019-12-18 15:32:17,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:17,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:32:17,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652085332] [2019-12-18 15:32:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:32:17,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:32:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:32:17,937 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 20 states. [2019-12-18 15:32:18,136 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-12-18 15:32:18,340 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-18 15:32:18,553 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-18 15:32:18,858 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-12-18 15:32:19,139 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-12-18 15:32:19,649 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-12-18 15:32:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:22,181 INFO L93 Difference]: Finished difference Result 7420 states and 24247 transitions. [2019-12-18 15:32:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:22,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 15:32:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:22,192 INFO L225 Difference]: With dead ends: 7420 [2019-12-18 15:32:22,193 INFO L226 Difference]: Without dead ends: 7420 [2019-12-18 15:32:22,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:32:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2019-12-18 15:32:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 4814. [2019-12-18 15:32:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-12-18 15:32:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 15490 transitions. [2019-12-18 15:32:22,264 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 15490 transitions. Word has length 30 [2019-12-18 15:32:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:22,264 INFO L462 AbstractCegarLoop]: Abstraction has 4814 states and 15490 transitions. [2019-12-18 15:32:22,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:32:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 15490 transitions. [2019-12-18 15:32:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:22,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:22,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:22,271 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2019-12-18 15:32:22,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:22,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775727082] [2019-12-18 15:32:22,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:23,249 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 15:32:23,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775727082] [2019-12-18 15:32:23,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:23,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:32:23,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066848508] [2019-12-18 15:32:23,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:32:23,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:23,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:32:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:32:23,250 INFO L87 Difference]: Start difference. First operand 4814 states and 15490 transitions. Second operand 19 states. [2019-12-18 15:32:23,590 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-18 15:32:23,770 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-18 15:32:24,003 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-18 15:32:24,387 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-18 15:32:24,827 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-12-18 15:32:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:26,693 INFO L93 Difference]: Finished difference Result 8625 states and 28142 transitions. [2019-12-18 15:32:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:26,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 15:32:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:26,709 INFO L225 Difference]: With dead ends: 8625 [2019-12-18 15:32:26,709 INFO L226 Difference]: Without dead ends: 8625 [2019-12-18 15:32:26,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2019-12-18 15:32:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2019-12-18 15:32:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 5356. [2019-12-18 15:32:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5356 states. [2019-12-18 15:32:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 17165 transitions. [2019-12-18 15:32:26,794 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 17165 transitions. Word has length 30 [2019-12-18 15:32:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:26,794 INFO L462 AbstractCegarLoop]: Abstraction has 5356 states and 17165 transitions. [2019-12-18 15:32:26,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:32:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 17165 transitions. [2019-12-18 15:32:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:26,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:26,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:26,799 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:26,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2019-12-18 15:32:26,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:26,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026325545] [2019-12-18 15:32:26,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:27,033 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-12-18 15:32:27,224 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 15:32:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026325545] [2019-12-18 15:32:27,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:27,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:32:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183395850] [2019-12-18 15:32:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:32:27,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:32:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:32:27,226 INFO L87 Difference]: Start difference. First operand 5356 states and 17165 transitions. Second operand 13 states. [2019-12-18 15:32:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:29,478 INFO L93 Difference]: Finished difference Result 13929 states and 44959 transitions. [2019-12-18 15:32:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:32:29,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-18 15:32:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:29,498 INFO L225 Difference]: With dead ends: 13929 [2019-12-18 15:32:29,498 INFO L226 Difference]: Without dead ends: 13929 [2019-12-18 15:32:29,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:32:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2019-12-18 15:32:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 8916. [2019-12-18 15:32:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8916 states. [2019-12-18 15:32:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8916 states to 8916 states and 29285 transitions. [2019-12-18 15:32:29,645 INFO L78 Accepts]: Start accepts. Automaton has 8916 states and 29285 transitions. Word has length 30 [2019-12-18 15:32:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:29,646 INFO L462 AbstractCegarLoop]: Abstraction has 8916 states and 29285 transitions. [2019-12-18 15:32:29,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:32:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8916 states and 29285 transitions. [2019-12-18 15:32:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:29,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:29,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:29,658 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2019-12-18 15:32:29,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:29,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503413105] [2019-12-18 15:32:29,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:30,562 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 15:32:30,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503413105] [2019-12-18 15:32:30,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:30,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:32:30,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118500946] [2019-12-18 15:32:30,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:32:30,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:32:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:32:30,563 INFO L87 Difference]: Start difference. First operand 8916 states and 29285 transitions. Second operand 19 states. [2019-12-18 15:32:31,231 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 15:32:31,586 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-18 15:32:31,887 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-18 15:32:32,153 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-18 15:32:32,393 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-18 15:32:32,782 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 15:32:33,198 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-12-18 15:32:33,464 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-12-18 15:32:33,704 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-12-18 15:32:34,131 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-18 15:32:34,674 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-18 15:32:34,885 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-12-18 15:32:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:38,017 INFO L93 Difference]: Finished difference Result 13681 states and 44884 transitions. [2019-12-18 15:32:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 15:32:38,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 15:32:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:38,038 INFO L225 Difference]: With dead ends: 13681 [2019-12-18 15:32:38,038 INFO L226 Difference]: Without dead ends: 13681 [2019-12-18 15:32:38,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:32:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-18 15:32:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 8966. [2019-12-18 15:32:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-12-18 15:32:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 29435 transitions. [2019-12-18 15:32:38,192 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 29435 transitions. Word has length 30 [2019-12-18 15:32:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:38,192 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 29435 transitions. [2019-12-18 15:32:38,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:32:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 29435 transitions. [2019-12-18 15:32:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:38,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:38,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:38,202 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1862000664, now seen corresponding path program 4 times [2019-12-18 15:32:38,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:38,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072590960] [2019-12-18 15:32:38,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:39,079 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 15:32:39,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072590960] [2019-12-18 15:32:39,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:39,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:32:39,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105937372] [2019-12-18 15:32:39,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:32:39,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:32:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:32:39,081 INFO L87 Difference]: Start difference. First operand 8966 states and 29435 transitions. Second operand 19 states. [2019-12-18 15:32:39,304 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-18 15:32:39,846 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 15:32:40,226 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-12-18 15:32:40,545 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-18 15:32:40,804 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-18 15:32:41,053 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-18 15:32:41,693 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-12-18 15:32:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:45,294 INFO L93 Difference]: Finished difference Result 13459 states and 44289 transitions. [2019-12-18 15:32:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:32:45,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 15:32:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:45,315 INFO L225 Difference]: With dead ends: 13459 [2019-12-18 15:32:45,315 INFO L226 Difference]: Without dead ends: 13459 [2019-12-18 15:32:45,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:32:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2019-12-18 15:32:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 9116. [2019-12-18 15:32:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-18 15:32:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29885 transitions. [2019-12-18 15:32:45,451 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29885 transitions. Word has length 30 [2019-12-18 15:32:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:45,451 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29885 transitions. [2019-12-18 15:32:45,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:32:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29885 transitions. [2019-12-18 15:32:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:45,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:45,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:45,459 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1889101151, now seen corresponding path program 2 times [2019-12-18 15:32:45,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:45,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013500282] [2019-12-18 15:32:45,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:46,423 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 15:32:46,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013500282] [2019-12-18 15:32:46,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:46,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:32:46,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444686952] [2019-12-18 15:32:46,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:32:46,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:46,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:32:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:32:46,424 INFO L87 Difference]: Start difference. First operand 9116 states and 29885 transitions. Second operand 19 states. [2019-12-18 15:32:47,354 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-18 15:32:47,508 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-18 15:32:47,774 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-18 15:32:47,969 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-18 15:32:48,520 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-18 15:32:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:52,103 INFO L93 Difference]: Finished difference Result 13859 states and 45489 transitions. [2019-12-18 15:32:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 15:32:52,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 15:32:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:52,125 INFO L225 Difference]: With dead ends: 13859 [2019-12-18 15:32:52,126 INFO L226 Difference]: Without dead ends: 13859 [2019-12-18 15:32:52,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:32:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13859 states. [2019-12-18 15:32:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13859 to 9116. [2019-12-18 15:32:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-18 15:32:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29885 transitions. [2019-12-18 15:32:52,278 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29885 transitions. Word has length 30 [2019-12-18 15:32:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:52,279 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29885 transitions. [2019-12-18 15:32:52,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:32:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29885 transitions. [2019-12-18 15:32:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:52,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:52,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:52,288 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1617209505, now seen corresponding path program 3 times [2019-12-18 15:32:52,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:52,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565223909] [2019-12-18 15:32:52,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:53,607 WARN L192 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-12-18 15:32:53,613 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 15:32:53,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565223909] [2019-12-18 15:32:53,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:53,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:32:53,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444581120] [2019-12-18 15:32:53,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:32:53,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:53,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:32:53,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:32:53,614 INFO L87 Difference]: Start difference. First operand 9116 states and 29885 transitions. Second operand 19 states. [2019-12-18 15:32:54,359 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 15:32:54,730 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-18 15:32:54,988 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-18 15:32:55,299 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-18 15:32:55,568 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-18 15:32:55,940 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-18 15:32:56,151 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-12-18 15:32:58,494 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-18 15:32:59,224 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-12-18 15:32:59,644 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-18 15:32:59,824 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-18 15:33:00,196 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-12-18 15:33:00,636 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-18 15:33:00,835 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-12-18 15:33:01,236 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-18 15:33:01,719 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-12-18 15:33:03,107 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-18 15:33:03,558 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-12-18 15:33:03,785 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-12-18 15:33:04,100 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-12-18 15:33:04,394 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-12-18 15:33:04,698 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-12-18 15:33:05,052 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-18 15:33:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:05,389 INFO L93 Difference]: Finished difference Result 20928 states and 69598 transitions. [2019-12-18 15:33:05,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 15:33:05,389 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 15:33:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:05,421 INFO L225 Difference]: With dead ends: 20928 [2019-12-18 15:33:05,421 INFO L226 Difference]: Without dead ends: 20928 [2019-12-18 15:33:05,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=820, Invalid=2372, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 15:33:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-18 15:33:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 11162. [2019-12-18 15:33:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 15:33:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 37373 transitions. [2019-12-18 15:33:05,613 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 37373 transitions. Word has length 30 [2019-12-18 15:33:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:05,613 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 37373 transitions. [2019-12-18 15:33:05,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:33:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 37373 transitions. [2019-12-18 15:33:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:05,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:05,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:05,624 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2122653751, now seen corresponding path program 4 times [2019-12-18 15:33:05,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:05,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325273190] [2019-12-18 15:33:05,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:06,326 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 15:33:06,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325273190] [2019-12-18 15:33:06,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:06,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:06,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530791790] [2019-12-18 15:33:06,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:06,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:06,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:06,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:06,328 INFO L87 Difference]: Start difference. First operand 11162 states and 37373 transitions. Second operand 17 states. [2019-12-18 15:33:07,008 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 15:33:07,330 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-18 15:33:07,884 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-18 15:33:08,135 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 15:33:08,446 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-18 15:33:08,661 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-18 15:33:08,817 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-12-18 15:33:11,049 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-18 15:33:11,360 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 15:33:11,549 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-18 15:33:11,810 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-18 15:33:12,086 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-12-18 15:33:12,383 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-18 15:33:12,626 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-18 15:33:12,860 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-12-18 15:33:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:15,050 INFO L93 Difference]: Finished difference Result 21452 states and 71187 transitions. [2019-12-18 15:33:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:33:15,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-12-18 15:33:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:15,084 INFO L225 Difference]: With dead ends: 21452 [2019-12-18 15:33:15,084 INFO L226 Difference]: Without dead ends: 21452 [2019-12-18 15:33:15,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=540, Invalid=1440, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 15:33:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2019-12-18 15:33:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 10584. [2019-12-18 15:33:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10584 states. [2019-12-18 15:33:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10584 states to 10584 states and 35593 transitions. [2019-12-18 15:33:15,273 INFO L78 Accepts]: Start accepts. Automaton has 10584 states and 35593 transitions. Word has length 30 [2019-12-18 15:33:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:15,273 INFO L462 AbstractCegarLoop]: Abstraction has 10584 states and 35593 transitions. [2019-12-18 15:33:15,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 10584 states and 35593 transitions. [2019-12-18 15:33:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:15,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:15,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:15,282 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 784664900, now seen corresponding path program 5 times [2019-12-18 15:33:15,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:15,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186604212] [2019-12-18 15:33:15,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:15,699 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 15:33:15,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186604212] [2019-12-18 15:33:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:15,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:33:15,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590293569] [2019-12-18 15:33:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:33:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:33:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:33:15,700 INFO L87 Difference]: Start difference. First operand 10584 states and 35593 transitions. Second operand 13 states. [2019-12-18 15:33:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:17,824 INFO L93 Difference]: Finished difference Result 18340 states and 61352 transitions. [2019-12-18 15:33:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:33:17,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-18 15:33:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:17,855 INFO L225 Difference]: With dead ends: 18340 [2019-12-18 15:33:17,855 INFO L226 Difference]: Without dead ends: 18340 [2019-12-18 15:33:17,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:33:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18340 states. [2019-12-18 15:33:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18340 to 9836. [2019-12-18 15:33:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9836 states. [2019-12-18 15:33:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9836 states to 9836 states and 33224 transitions. [2019-12-18 15:33:18,039 INFO L78 Accepts]: Start accepts. Automaton has 9836 states and 33224 transitions. Word has length 30 [2019-12-18 15:33:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:18,039 INFO L462 AbstractCegarLoop]: Abstraction has 9836 states and 33224 transitions. [2019-12-18 15:33:18,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:33:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9836 states and 33224 transitions. [2019-12-18 15:33:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:33:18,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:18,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:18,048 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -838148739, now seen corresponding path program 1 times [2019-12-18 15:33:18,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:18,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006743429] [2019-12-18 15:33:18,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:18,597 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-12-18 15:33:18,927 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 15:33:18,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006743429] [2019-12-18 15:33:18,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:18,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:33:18,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897980468] [2019-12-18 15:33:18,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:33:18,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:18,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:33:18,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:33:18,929 INFO L87 Difference]: Start difference. First operand 9836 states and 33224 transitions. Second operand 19 states. [2019-12-18 15:33:19,761 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-12-18 15:33:20,084 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 15:33:20,243 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-12-18 15:33:20,390 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 15:33:20,719 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-12-18 15:33:20,898 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-18 15:33:21,065 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 15:33:21,326 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-12-18 15:33:21,610 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:33:21,801 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-18 15:33:22,251 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-12-18 15:33:22,469 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-18 15:33:22,897 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-18 15:33:23,128 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-18 15:33:24,019 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2019-12-18 15:33:24,280 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-12-18 15:33:24,436 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:33:24,741 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-18 15:33:24,926 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-18 15:33:25,113 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 15:33:25,402 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 15:33:25,621 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2019-12-18 15:33:25,835 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 15:33:26,193 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-12-18 15:33:26,444 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-18 15:33:26,665 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-12-18 15:33:26,891 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-12-18 15:33:27,162 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-12-18 15:33:27,411 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-12-18 15:33:27,708 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-18 15:33:28,010 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-18 15:33:28,352 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-12-18 15:33:28,751 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-12-18 15:33:29,228 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2019-12-18 15:33:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:29,440 INFO L93 Difference]: Finished difference Result 11116 states and 37084 transitions. [2019-12-18 15:33:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:33:29,441 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 15:33:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:29,457 INFO L225 Difference]: With dead ends: 11116 [2019-12-18 15:33:29,457 INFO L226 Difference]: Without dead ends: 11116 [2019-12-18 15:33:29,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1130, Invalid=2776, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:33:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2019-12-18 15:33:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 10736. [2019-12-18 15:33:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2019-12-18 15:33:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 35984 transitions. [2019-12-18 15:33:29,591 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 35984 transitions. Word has length 31 [2019-12-18 15:33:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:29,591 INFO L462 AbstractCegarLoop]: Abstraction has 10736 states and 35984 transitions. [2019-12-18 15:33:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:33:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 35984 transitions. [2019-12-18 15:33:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:33:29,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:29,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:29,601 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1965024921, now seen corresponding path program 2 times [2019-12-18 15:33:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:29,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758495157] [2019-12-18 15:33:29,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:30,559 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 15:33:30,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758495157] [2019-12-18 15:33:30,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:30,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 15:33:30,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888390880] [2019-12-18 15:33:30,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:33:30,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:33:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:33:30,561 INFO L87 Difference]: Start difference. First operand 10736 states and 35984 transitions. Second operand 20 states. [2019-12-18 15:33:31,716 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-12-18 15:33:32,244 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 15:33:32,424 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-18 15:33:32,581 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-12-18 15:33:32,990 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-18 15:33:33,169 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-12-18 15:33:33,681 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 15:33:33,871 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-12-18 15:33:34,073 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-12-18 15:33:34,596 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-18 15:33:34,924 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-12-18 15:33:35,424 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-18 15:33:35,641 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-18 15:33:36,760 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-18 15:33:37,026 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:33:37,193 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:33:37,392 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-18 15:33:37,703 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-18 15:33:37,896 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-18 15:33:38,082 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-18 15:33:38,279 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 15:33:38,561 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 15:33:38,806 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-18 15:33:39,038 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-12-18 15:33:39,441 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-18 15:33:39,718 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-18 15:33:39,936 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 15:33:40,177 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 15:33:40,462 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-12-18 15:33:40,716 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-12-18 15:33:41,029 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-18 15:33:41,344 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-18 15:33:41,688 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-18 15:33:41,999 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-18 15:33:42,544 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-12-18 15:33:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:42,711 INFO L93 Difference]: Finished difference Result 11456 states and 38144 transitions. [2019-12-18 15:33:42,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 15:33:42,711 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-18 15:33:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:42,727 INFO L225 Difference]: With dead ends: 11456 [2019-12-18 15:33:42,728 INFO L226 Difference]: Without dead ends: 11456 [2019-12-18 15:33:42,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1310, Invalid=3520, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 15:33:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11456 states. [2019-12-18 15:33:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11456 to 10496. [2019-12-18 15:33:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10496 states. [2019-12-18 15:33:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10496 states to 10496 states and 35264 transitions. [2019-12-18 15:33:42,866 INFO L78 Accepts]: Start accepts. Automaton has 10496 states and 35264 transitions. Word has length 31 [2019-12-18 15:33:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:42,866 INFO L462 AbstractCegarLoop]: Abstraction has 10496 states and 35264 transitions. [2019-12-18 15:33:42,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:33:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 10496 states and 35264 transitions. [2019-12-18 15:33:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:33:42,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:42,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:42,877 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 288220857, now seen corresponding path program 3 times [2019-12-18 15:33:42,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:42,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914208591] [2019-12-18 15:33:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:43,775 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 15:33:43,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914208591] [2019-12-18 15:33:43,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:43,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:33:43,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115875609] [2019-12-18 15:33:43,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:33:43,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:33:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:33:43,777 INFO L87 Difference]: Start difference. First operand 10496 states and 35264 transitions. Second operand 19 states. [2019-12-18 15:33:44,819 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-12-18 15:33:44,961 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-12-18 15:33:45,488 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-12-18 15:33:45,702 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-12-18 15:33:45,879 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-18 15:33:46,268 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-18 15:33:46,455 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-18 15:33:46,747 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-18 15:33:47,073 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 15:33:47,257 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-12-18 15:33:47,445 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-18 15:33:47,997 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-18 15:33:48,213 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 15:33:48,721 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-18 15:33:48,933 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-12-18 15:33:50,173 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-12-18 15:33:50,442 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:33:50,594 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 15:33:50,782 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-18 15:33:51,107 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-18 15:33:51,304 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-18 15:33:51,484 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 15:33:51,676 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-18 15:33:51,947 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 15:33:52,178 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-18 15:33:52,395 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-18 15:33:52,797 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-12-18 15:33:53,066 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-18 15:33:53,267 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-18 15:33:53,451 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 15:33:53,687 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 15:33:53,968 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-18 15:33:54,212 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-18 15:33:54,561 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-18 15:33:54,867 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-12-18 15:33:55,210 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2019-12-18 15:33:55,509 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-12-18 15:33:56,016 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-12-18 15:33:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:56,320 INFO L93 Difference]: Finished difference Result 10756 states and 36004 transitions. [2019-12-18 15:33:56,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 15:33:56,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 15:33:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:56,335 INFO L225 Difference]: With dead ends: 10756 [2019-12-18 15:33:56,336 INFO L226 Difference]: Without dead ends: 10756 [2019-12-18 15:33:56,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1374, Invalid=3596, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 15:33:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-18 15:33:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10356. [2019-12-18 15:33:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10356 states. [2019-12-18 15:33:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10356 states to 10356 states and 34804 transitions. [2019-12-18 15:33:56,612 INFO L78 Accepts]: Start accepts. Automaton has 10356 states and 34804 transitions. Word has length 31 [2019-12-18 15:33:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 10356 states and 34804 transitions. [2019-12-18 15:33:56,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:33:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10356 states and 34804 transitions. [2019-12-18 15:33:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:33:56,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:56,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:56,622 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1133622845, now seen corresponding path program 4 times [2019-12-18 15:33:56,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:56,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422033145] [2019-12-18 15:33:56,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:57,485 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 15:33:57,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422033145] [2019-12-18 15:33:57,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:57,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:33:57,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488394518] [2019-12-18 15:33:57,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:33:57,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:33:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:33:57,487 INFO L87 Difference]: Start difference. First operand 10356 states and 34804 transitions. Second operand 19 states. [2019-12-18 15:33:59,034 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-18 15:33:59,211 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 15:33:59,758 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-18 15:33:59,970 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-18 15:34:00,148 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-18 15:34:00,423 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-18 15:34:00,702 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 15:34:00,910 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-12-18 15:34:01,160 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-18 15:34:01,484 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 15:34:01,678 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 15:34:01,950 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-18 15:34:02,480 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-18 15:34:02,744 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 15:34:03,283 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-12-18 15:34:03,500 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-18 15:34:04,528 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-12-18 15:34:05,443 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 15:34:05,615 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-18 15:34:05,804 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-18 15:34:06,075 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 15:34:06,276 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-18 15:34:06,479 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 15:34:06,705 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-18 15:34:06,939 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-18 15:34:07,217 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-18 15:34:07,450 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-18 15:34:07,726 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 Received shutdown request... [2019-12-18 15:34:07,933 WARN L209 SmtUtils]: Removed 4 from assertion stack [2019-12-18 15:34:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 15:34:07,934 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:34:07,940 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:34:07,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:34:07 BasicIcfg [2019-12-18 15:34:07,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:34:07,944 INFO L168 Benchmark]: Toolchain (without parser) took 242691.61 ms. Allocated memory was 138.9 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 101.6 MB in the beginning and 909.8 MB in the end (delta: -808.1 MB). Peak memory consumption was 665.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,945 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 962.12 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 124.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.69 ms. Allocated memory is still 202.9 MB. Free memory was 124.4 MB in the beginning and 120.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,946 INFO L168 Benchmark]: Boogie Preprocessor took 94.63 ms. Allocated memory is still 202.9 MB. Free memory was 120.8 MB in the beginning and 118.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,946 INFO L168 Benchmark]: RCFGBuilder took 1083.83 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 118.8 MB in the beginning and 195.3 MB in the end (delta: -76.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,950 INFO L168 Benchmark]: TraceAbstraction took 240396.87 ms. Allocated memory was 236.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 195.3 MB in the beginning and 909.8 MB in the end (delta: -714.5 MB). Peak memory consumption was 661.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:07,952 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 962.12 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 124.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 143.69 ms. Allocated memory is still 202.9 MB. Free memory was 124.4 MB in the beginning and 120.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.63 ms. Allocated memory is still 202.9 MB. Free memory was 120.8 MB in the beginning and 118.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1083.83 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 118.8 MB in the beginning and 195.3 MB in the end (delta: -76.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240396.87 ms. Allocated memory was 236.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 195.3 MB in the beginning and 909.8 MB in the end (delta: -714.5 MB). Peak memory consumption was 661.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (10356states) and FLOYD_HOARE automaton (currently 50 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 88ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (10356states) and FLOYD_HOARE automaton (currently 50 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 88ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (10356states) and FLOYD_HOARE automaton (currently 50 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 88ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (10356states) and FLOYD_HOARE automaton (currently 50 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 88ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 240.1s, OverallIterations: 45, TraceHistogramMax: 1, AutomataDifference: 196.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3364 SDtfs, 14553 SDslu, 16879 SDs, 0 SdLazy, 90800 SolverSat, 1502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 99.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 26 SyntacticMatches, 39 SemanticMatches, 1340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7449 ImplicationChecksByTransitivity, 106.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11162occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 106710 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 970349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 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