/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:23:43,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:23:43,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:23:43,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:23:43,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:23:43,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:23:43,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:23:43,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:23:43,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:23:43,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:23:43,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:23:43,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:23:43,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:23:43,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:23:43,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:23:43,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:23:43,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:23:43,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:23:43,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:23:43,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:23:43,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:23:43,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:23:43,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:23:43,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:23:43,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:23:43,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:23:43,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:23:43,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:23:43,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:23:43,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:23:43,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:23:43,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:23:43,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:23:43,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:23:43,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:23:43,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:23:43,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:23:43,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:23:43,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:23:43,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:23:43,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:23:43,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:23:43,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:23:43,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:23:43,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:23:43,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:23:43,714 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:23:43,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:23:43,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:23:43,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:23:43,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:23:43,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:23:43,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:23:43,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:23:43,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:23:43,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:23:43,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:23:43,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:23:43,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:23:43,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:23:43,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:23:43,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:23:43,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:23:43,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:23:43,719 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:23:43,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:23:43,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:23:43,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:23:44,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:23:44,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:23:44,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:23:44,016 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:23:44,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 23:23:44,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e14e697/d73e27dd229e4acbb21477a89e47193a/FLAGdf60c8a61 [2019-12-18 23:23:44,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:23:44,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 23:23:44,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e14e697/d73e27dd229e4acbb21477a89e47193a/FLAGdf60c8a61 [2019-12-18 23:23:44,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e14e697/d73e27dd229e4acbb21477a89e47193a [2019-12-18 23:23:44,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:23:44,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:23:44,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:44,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:23:44,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:23:44,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:44" (1/1) ... [2019-12-18 23:23:44,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efcdce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:44, skipping insertion in model container [2019-12-18 23:23:44,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:44" (1/1) ... [2019-12-18 23:23:44,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:23:45,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:23:45,203 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:45,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:45,610 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:23:45,632 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:45,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:45,868 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:23:45,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45 WrapperNode [2019-12-18 23:23:45,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:45,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:45,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:23:45,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:23:45,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:45,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:23:45,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:23:45,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:23:45,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:45,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:46,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (1/1) ... [2019-12-18 23:23:46,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:23:46,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:23:46,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:23:46,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:23:46,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (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 23:23:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 23:23:46,110 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 23:23:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 23:23:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 23:23:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:23:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:23:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:23:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:23:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 23:23:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 23:23:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:23:46,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:23:46,117 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 23:23:47,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:23:47,153 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 23:23:47,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:47 BoogieIcfgContainer [2019-12-18 23:23:47,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:23:47,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:23:47,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:23:47,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:23:47,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:23:44" (1/3) ... [2019-12-18 23:23:47,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed453fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:47, skipping insertion in model container [2019-12-18 23:23:47,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:45" (2/3) ... [2019-12-18 23:23:47,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed453fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:47, skipping insertion in model container [2019-12-18 23:23:47,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:47" (3/3) ... [2019-12-18 23:23:47,165 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2019-12-18 23:23:47,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:23:47,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:23:47,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 23:23:47,184 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:23:47,226 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,226 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,226 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,227 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,227 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,227 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,228 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,228 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,228 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,228 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,228 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,229 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,229 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,229 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,229 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,229 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,230 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,230 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,230 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,230 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,230 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,231 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,232 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,232 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,232 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,232 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,232 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,233 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,233 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,233 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,233 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,233 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,234 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,234 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,234 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,234 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,234 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,235 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,236 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,237 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,237 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,237 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,237 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,237 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,238 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,238 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,238 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,238 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,238 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,239 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,239 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,239 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,239 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,239 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,240 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,241 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,242 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,242 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,242 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,242 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,242 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,243 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,243 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,243 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,243 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,243 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,244 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,245 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,245 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,245 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,245 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,245 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,246 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,246 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,246 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,246 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,246 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,248 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,249 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,250 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,250 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,250 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,250 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,252 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,252 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,254 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,255 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,255 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,256 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,257 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,257 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,257 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,257 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,257 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,258 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,259 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,260 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,261 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,262 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,263 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,264 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,264 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,264 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,264 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,264 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,265 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,266 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,266 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,266 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,266 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,266 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,267 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,267 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,267 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,267 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,268 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,272 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,272 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,272 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,272 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,272 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,273 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,277 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,277 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,277 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,277 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,277 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,278 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,278 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,284 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,287 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,287 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,287 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:47,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 23:23:47,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:23:47,327 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:23:47,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:23:47,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:23:47,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:23:47,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:23:47,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:23:47,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:23:47,347 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions [2019-12-18 23:23:47,350 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 23:23:47,444 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 23:23:47,444 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:47,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 23:23:47,490 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 23:23:47,538 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 23:23:47,539 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:47,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 23:23:47,566 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2019-12-18 23:23:47,567 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:23:51,364 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-18 23:23:51,501 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-18 23:23:51,895 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-12-18 23:23:52,052 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-18 23:23:52,088 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27552 [2019-12-18 23:23:52,089 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-18 23:23:52,093 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 65 transitions [2019-12-18 23:23:52,236 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2019-12-18 23:23:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2019-12-18 23:23:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:23:52,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:52,260 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 23:23:52,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:23:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -825162615, now seen corresponding path program 1 times [2019-12-18 23:23:52,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:52,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141207823] [2019-12-18 23:23:52,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:52,738 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 23:23:52,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141207823] [2019-12-18 23:23:52,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:52,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:23:52,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769837324] [2019-12-18 23:23:52,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:23:52,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:23:52,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:23:52,765 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2019-12-18 23:23:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:53,155 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2019-12-18 23:23:53,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:23:53,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 23:23:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:53,198 INFO L225 Difference]: With dead ends: 2543 [2019-12-18 23:23:53,198 INFO L226 Difference]: Without dead ends: 2405 [2019-12-18 23:23:53,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:23:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-12-18 23:23:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2019-12-18 23:23:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-12-18 23:23:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2019-12-18 23:23:53,353 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2019-12-18 23:23:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:53,353 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2019-12-18 23:23:53,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:23:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2019-12-18 23:23:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:23:53,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:53,357 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 23:23:53,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:23:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash -807595204, now seen corresponding path program 1 times [2019-12-18 23:23:53,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:53,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997802675] [2019-12-18 23:23:53,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:53,571 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 23:23:53,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997802675] [2019-12-18 23:23:53,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:53,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:23:53,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886330697] [2019-12-18 23:23:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:23:53,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:23:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:23:53,575 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2019-12-18 23:23:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:54,357 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2019-12-18 23:23:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:23:54,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 23:23:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:54,404 INFO L225 Difference]: With dead ends: 3979 [2019-12-18 23:23:54,404 INFO L226 Difference]: Without dead ends: 3939 [2019-12-18 23:23:54,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:23:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2019-12-18 23:23:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2019-12-18 23:23:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-12-18 23:23:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2019-12-18 23:23:54,535 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2019-12-18 23:23:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:54,536 INFO L462 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2019-12-18 23:23:54,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:23:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2019-12-18 23:23:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:23:54,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:54,541 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 23:23:54,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:23:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1728920918, now seen corresponding path program 2 times [2019-12-18 23:23:54,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:54,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441342019] [2019-12-18 23:23:54,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:54,733 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 23:23:54,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441342019] [2019-12-18 23:23:54,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:54,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:23:54,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945838438] [2019-12-18 23:23:54,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:23:54,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:23:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:23:54,737 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2019-12-18 23:23:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:55,286 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2019-12-18 23:23:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:23:55,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 23:23:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:55,310 INFO L225 Difference]: With dead ends: 3485 [2019-12-18 23:23:55,310 INFO L226 Difference]: Without dead ends: 3437 [2019-12-18 23:23:55,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:23:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-12-18 23:23:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2019-12-18 23:23:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-18 23:23:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2019-12-18 23:23:55,401 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2019-12-18 23:23:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:55,402 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2019-12-18 23:23:55,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:23:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2019-12-18 23:23:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:23:55,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:55,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 23:23:55,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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:23:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2067850681, now seen corresponding path program 1 times [2019-12-18 23:23:55,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:55,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160352052] [2019-12-18 23:23:55,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:56,065 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 23:23:56,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160352052] [2019-12-18 23:23:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:23:56,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427973944] [2019-12-18 23:23:56,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:23:56,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:56,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:23:56,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:23:56,067 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 14 states. [2019-12-18 23:23:57,405 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-18 23:23:57,578 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-18 23:23:57,838 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-18 23:23:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:58,316 INFO L93 Difference]: Finished difference Result 3530 states and 11488 transitions. [2019-12-18 23:23:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:23:58,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:23:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:58,338 INFO L225 Difference]: With dead ends: 3530 [2019-12-18 23:23:58,338 INFO L226 Difference]: Without dead ends: 3530 [2019-12-18 23:23:58,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-12-18 23:23:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-12-18 23:23:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3024. [2019-12-18 23:23:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2019-12-18 23:23:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 9819 transitions. [2019-12-18 23:23:58,428 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 9819 transitions. Word has length 25 [2019-12-18 23:23:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:58,429 INFO L462 AbstractCegarLoop]: Abstraction has 3024 states and 9819 transitions. [2019-12-18 23:23:58,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:23:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 9819 transitions. [2019-12-18 23:23:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:23:58,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:58,435 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 23:23:58,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:23:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1809740468, now seen corresponding path program 1 times [2019-12-18 23:23:58,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:58,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600237784] [2019-12-18 23:23:58,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:58,994 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 23:23:58,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600237784] [2019-12-18 23:23:58,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:58,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:23:58,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873044400] [2019-12-18 23:23:58,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:23:58,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:58,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:23:58,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:23:58,996 INFO L87 Difference]: Start difference. First operand 3024 states and 9819 transitions. Second operand 13 states. [2019-12-18 23:24:00,206 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-12-18 23:24:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:00,614 INFO L93 Difference]: Finished difference Result 3115 states and 10104 transitions. [2019-12-18 23:24:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:24:00,614 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:24:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:00,635 INFO L225 Difference]: With dead ends: 3115 [2019-12-18 23:24:00,635 INFO L226 Difference]: Without dead ends: 3115 [2019-12-18 23:24:00,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:24:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2019-12-18 23:24:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3103. [2019-12-18 23:24:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3103 states. [2019-12-18 23:24:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 10079 transitions. [2019-12-18 23:24:00,719 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 10079 transitions. Word has length 25 [2019-12-18 23:24:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 3103 states and 10079 transitions. [2019-12-18 23:24:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:24:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 10079 transitions. [2019-12-18 23:24:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:00,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:00,726 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 23:24:00,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash 430278225, now seen corresponding path program 2 times [2019-12-18 23:24:00,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:00,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103155328] [2019-12-18 23:24:00,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:01,266 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 23:24:01,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103155328] [2019-12-18 23:24:01,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:01,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:01,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524156762] [2019-12-18 23:24:01,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:01,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:01,268 INFO L87 Difference]: Start difference. First operand 3103 states and 10079 transitions. Second operand 14 states. [2019-12-18 23:24:02,901 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-18 23:24:03,088 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-18 23:24:03,410 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-12-18 23:24:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:03,955 INFO L93 Difference]: Finished difference Result 3700 states and 12029 transitions. [2019-12-18 23:24:03,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:24:03,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:03,968 INFO L225 Difference]: With dead ends: 3700 [2019-12-18 23:24:03,968 INFO L226 Difference]: Without dead ends: 3700 [2019-12-18 23:24:03,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2019-12-18 23:24:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3173. [2019-12-18 23:24:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3173 states. [2019-12-18 23:24:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 10358 transitions. [2019-12-18 23:24:04,117 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 10358 transitions. Word has length 25 [2019-12-18 23:24:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:04,117 INFO L462 AbstractCegarLoop]: Abstraction has 3173 states and 10358 transitions. [2019-12-18 23:24:04,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 10358 transitions. [2019-12-18 23:24:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:04,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:04,129 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 23:24:04,129 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -78693817, now seen corresponding path program 3 times [2019-12-18 23:24:04,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:04,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590755750] [2019-12-18 23:24:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:04,680 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 23:24:04,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590755750] [2019-12-18 23:24:04,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:04,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:04,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169153971] [2019-12-18 23:24:04,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:04,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:04,682 INFO L87 Difference]: Start difference. First operand 3173 states and 10358 transitions. Second operand 14 states. [2019-12-18 23:24:06,494 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-12-18 23:24:06,697 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-12-18 23:24:06,850 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-18 23:24:07,019 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 23:24:07,335 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 23:24:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:07,814 INFO L93 Difference]: Finished difference Result 3641 states and 11754 transitions. [2019-12-18 23:24:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:07,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:07,827 INFO L225 Difference]: With dead ends: 3641 [2019-12-18 23:24:07,827 INFO L226 Difference]: Without dead ends: 3641 [2019-12-18 23:24:07,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-12-18 23:24:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3383. [2019-12-18 23:24:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2019-12-18 23:24:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 11015 transitions. [2019-12-18 23:24:07,915 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 11015 transitions. Word has length 25 [2019-12-18 23:24:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:07,915 INFO L462 AbstractCegarLoop]: Abstraction has 3383 states and 11015 transitions. [2019-12-18 23:24:07,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 11015 transitions. [2019-12-18 23:24:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:07,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:07,922 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 23:24:07,922 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash -675763345, now seen corresponding path program 4 times [2019-12-18 23:24:07,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:07,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380063353] [2019-12-18 23:24:07,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:08,349 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 23:24:08,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380063353] [2019-12-18 23:24:08,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:08,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:08,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094708725] [2019-12-18 23:24:08,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:08,351 INFO L87 Difference]: Start difference. First operand 3383 states and 11015 transitions. Second operand 14 states. [2019-12-18 23:24:09,510 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-12-18 23:24:10,436 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-12-18 23:24:10,629 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-18 23:24:10,910 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 23:24:11,090 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 23:24:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:11,589 INFO L93 Difference]: Finished difference Result 3593 states and 11602 transitions. [2019-12-18 23:24:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:11,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:11,601 INFO L225 Difference]: With dead ends: 3593 [2019-12-18 23:24:11,601 INFO L226 Difference]: Without dead ends: 3593 [2019-12-18 23:24:11,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2019-12-18 23:24:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3454. [2019-12-18 23:24:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2019-12-18 23:24:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 11236 transitions. [2019-12-18 23:24:11,691 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 11236 transitions. Word has length 25 [2019-12-18 23:24:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:11,692 INFO L462 AbstractCegarLoop]: Abstraction has 3454 states and 11236 transitions. [2019-12-18 23:24:11,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 11236 transitions. [2019-12-18 23:24:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:11,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:11,698 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 23:24:11,699 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1056851865, now seen corresponding path program 5 times [2019-12-18 23:24:11,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:11,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536060607] [2019-12-18 23:24:11,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:12,253 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 23:24:12,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536060607] [2019-12-18 23:24:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:24:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396724037] [2019-12-18 23:24:12,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:24:12,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:24:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:24:12,256 INFO L87 Difference]: Start difference. First operand 3454 states and 11236 transitions. Second operand 13 states. [2019-12-18 23:24:13,256 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-12-18 23:24:14,114 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-12-18 23:24:14,302 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-18 23:24:14,566 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 23:24:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:14,917 INFO L93 Difference]: Finished difference Result 3659 states and 11816 transitions. [2019-12-18 23:24:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:14,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:24:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:14,931 INFO L225 Difference]: With dead ends: 3659 [2019-12-18 23:24:14,931 INFO L226 Difference]: Without dead ends: 3659 [2019-12-18 23:24:14,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2019-12-18 23:24:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3537. [2019-12-18 23:24:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3537 states. [2019-12-18 23:24:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 11498 transitions. [2019-12-18 23:24:15,021 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 11498 transitions. Word has length 25 [2019-12-18 23:24:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:15,022 INFO L462 AbstractCegarLoop]: Abstraction has 3537 states and 11498 transitions. [2019-12-18 23:24:15,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:24:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 11498 transitions. [2019-12-18 23:24:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:15,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:15,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:15,029 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:15,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1579015134, now seen corresponding path program 2 times [2019-12-18 23:24:15,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:15,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458416467] [2019-12-18 23:24:15,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:15,554 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 23:24:15,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458416467] [2019-12-18 23:24:15,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:15,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:24:15,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407962018] [2019-12-18 23:24:15,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:24:15,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:24:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:24:15,556 INFO L87 Difference]: Start difference. First operand 3537 states and 11498 transitions. Second operand 13 states. [2019-12-18 23:24:16,861 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-18 23:24:17,105 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-18 23:24:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:17,618 INFO L93 Difference]: Finished difference Result 4074 states and 13237 transitions. [2019-12-18 23:24:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:24:17,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:24:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:17,629 INFO L225 Difference]: With dead ends: 4074 [2019-12-18 23:24:17,630 INFO L226 Difference]: Without dead ends: 4074 [2019-12-18 23:24:17,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:24:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2019-12-18 23:24:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 3594. [2019-12-18 23:24:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-18 23:24:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11725 transitions. [2019-12-18 23:24:17,722 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11725 transitions. Word has length 25 [2019-12-18 23:24:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:17,722 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11725 transitions. [2019-12-18 23:24:17,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:24:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11725 transitions. [2019-12-18 23:24:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:17,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:17,729 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 23:24:17,730 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1703259630, now seen corresponding path program 3 times [2019-12-18 23:24:17,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:17,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895669732] [2019-12-18 23:24:17,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:18,212 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 23:24:18,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895669732] [2019-12-18 23:24:18,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:18,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:24:18,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476170143] [2019-12-18 23:24:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:24:18,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:24:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:24:18,214 INFO L87 Difference]: Start difference. First operand 3594 states and 11725 transitions. Second operand 13 states. [2019-12-18 23:24:19,165 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-18 23:24:19,867 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-18 23:24:20,119 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-18 23:24:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:20,596 INFO L93 Difference]: Finished difference Result 4036 states and 13118 transitions. [2019-12-18 23:24:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:24:20,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:24:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:20,605 INFO L225 Difference]: With dead ends: 4036 [2019-12-18 23:24:20,605 INFO L226 Difference]: Without dead ends: 4036 [2019-12-18 23:24:20,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:24:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2019-12-18 23:24:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3778. [2019-12-18 23:24:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3778 states. [2019-12-18 23:24:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 12373 transitions. [2019-12-18 23:24:20,688 INFO L78 Accepts]: Start accepts. Automaton has 3778 states and 12373 transitions. Word has length 25 [2019-12-18 23:24:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:20,689 INFO L462 AbstractCegarLoop]: Abstraction has 3778 states and 12373 transitions. [2019-12-18 23:24:20,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:24:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 12373 transitions. [2019-12-18 23:24:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:20,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:20,696 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 23:24:20,697 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1645369854, now seen corresponding path program 4 times [2019-12-18 23:24:20,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:20,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66102373] [2019-12-18 23:24:20,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:21,149 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 23:24:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66102373] [2019-12-18 23:24:21,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:21,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:24:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255984969] [2019-12-18 23:24:21,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:24:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:24:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:24:21,151 INFO L87 Difference]: Start difference. First operand 3778 states and 12373 transitions. Second operand 12 states. [2019-12-18 23:24:22,783 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-18 23:24:23,051 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-18 23:24:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:23,374 INFO L93 Difference]: Finished difference Result 4048 states and 13033 transitions. [2019-12-18 23:24:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:24:23,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 23:24:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:23,381 INFO L225 Difference]: With dead ends: 4048 [2019-12-18 23:24:23,381 INFO L226 Difference]: Without dead ends: 4048 [2019-12-18 23:24:23,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:24:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2019-12-18 23:24:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3948. [2019-12-18 23:24:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 23:24:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2019-12-18 23:24:23,461 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2019-12-18 23:24:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:23,462 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2019-12-18 23:24:23,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:24:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2019-12-18 23:24:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:23,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:23,469 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 23:24:23,469 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash 261726937, now seen corresponding path program 6 times [2019-12-18 23:24:23,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:23,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877457553] [2019-12-18 23:24:23,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:23,998 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 23:24:23,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877457553] [2019-12-18 23:24:23,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:23,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:23,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814106739] [2019-12-18 23:24:23,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:23,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:24,000 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 14 states. [2019-12-18 23:24:25,257 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-18 23:24:25,434 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-18 23:24:25,706 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-18 23:24:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:26,211 INFO L93 Difference]: Finished difference Result 4093 states and 13165 transitions. [2019-12-18 23:24:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:24:26,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:26,218 INFO L225 Difference]: With dead ends: 4093 [2019-12-18 23:24:26,219 INFO L226 Difference]: Without dead ends: 4093 [2019-12-18 23:24:26,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:24:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2019-12-18 23:24:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4022. [2019-12-18 23:24:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2019-12-18 23:24:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 13022 transitions. [2019-12-18 23:24:26,301 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 13022 transitions. Word has length 25 [2019-12-18 23:24:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:26,301 INFO L462 AbstractCegarLoop]: Abstraction has 4022 states and 13022 transitions. [2019-12-18 23:24:26,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 13022 transitions. [2019-12-18 23:24:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:26,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:26,310 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 23:24:26,310 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1375845519, now seen corresponding path program 7 times [2019-12-18 23:24:26,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:26,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436572789] [2019-12-18 23:24:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:26,918 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 23:24:26,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436572789] [2019-12-18 23:24:26,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:26,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:26,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588230856] [2019-12-18 23:24:26,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:26,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:26,920 INFO L87 Difference]: Start difference. First operand 4022 states and 13022 transitions. Second operand 14 states. [2019-12-18 23:24:28,189 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-18 23:24:28,369 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-18 23:24:28,645 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-18 23:24:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:29,077 INFO L93 Difference]: Finished difference Result 4865 states and 15721 transitions. [2019-12-18 23:24:29,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:24:29,078 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:29,085 INFO L225 Difference]: With dead ends: 4865 [2019-12-18 23:24:29,085 INFO L226 Difference]: Without dead ends: 4865 [2019-12-18 23:24:29,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-18 23:24:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2019-12-18 23:24:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4130. [2019-12-18 23:24:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2019-12-18 23:24:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 13463 transitions. [2019-12-18 23:24:29,177 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 13463 transitions. Word has length 25 [2019-12-18 23:24:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:29,178 INFO L462 AbstractCegarLoop]: Abstraction has 4130 states and 13463 transitions. [2019-12-18 23:24:29,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 13463 transitions. [2019-12-18 23:24:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:29,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:29,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:29,187 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1884817561, now seen corresponding path program 8 times [2019-12-18 23:24:29,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:29,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95882329] [2019-12-18 23:24:29,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:29,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 23:24:29,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95882329] [2019-12-18 23:24:29,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:29,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:29,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108386885] [2019-12-18 23:24:29,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:29,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:29,701 INFO L87 Difference]: Start difference. First operand 4130 states and 13463 transitions. Second operand 14 states. [2019-12-18 23:24:30,419 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-18 23:24:31,505 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-18 23:24:31,666 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-18 23:24:31,818 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-18 23:24:32,003 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-18 23:24:32,303 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-18 23:24:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:32,819 INFO L93 Difference]: Finished difference Result 4806 states and 15415 transitions. [2019-12-18 23:24:32,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:32,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:32,826 INFO L225 Difference]: With dead ends: 4806 [2019-12-18 23:24:32,827 INFO L226 Difference]: Without dead ends: 4806 [2019-12-18 23:24:32,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:24:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-18 23:24:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4454. [2019-12-18 23:24:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-18 23:24:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 14489 transitions. [2019-12-18 23:24:32,898 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 14489 transitions. Word has length 25 [2019-12-18 23:24:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:32,898 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 14489 transitions. [2019-12-18 23:24:32,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 14489 transitions. [2019-12-18 23:24:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:32,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:32,904 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 23:24:32,904 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1813080207, now seen corresponding path program 9 times [2019-12-18 23:24:32,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:32,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460419964] [2019-12-18 23:24:32,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:33,340 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 23:24:33,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460419964] [2019-12-18 23:24:33,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:33,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:33,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267104152] [2019-12-18 23:24:33,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:33,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:33,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:33,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:33,342 INFO L87 Difference]: Start difference. First operand 4454 states and 14489 transitions. Second operand 14 states. [2019-12-18 23:24:35,435 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-18 23:24:35,630 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-12-18 23:24:35,892 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-12-18 23:24:36,084 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 23:24:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:36,610 INFO L93 Difference]: Finished difference Result 4758 states and 15263 transitions. [2019-12-18 23:24:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:36,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:36,618 INFO L225 Difference]: With dead ends: 4758 [2019-12-18 23:24:36,618 INFO L226 Difference]: Without dead ends: 4758 [2019-12-18 23:24:36,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:24:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2019-12-18 23:24:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4562. [2019-12-18 23:24:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4562 states. [2019-12-18 23:24:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 14831 transitions. [2019-12-18 23:24:36,709 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 14831 transitions. Word has length 25 [2019-12-18 23:24:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:36,709 INFO L462 AbstractCegarLoop]: Abstraction has 4562 states and 14831 transitions. [2019-12-18 23:24:36,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 14831 transitions. [2019-12-18 23:24:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:36,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:36,715 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 23:24:36,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash -749271879, now seen corresponding path program 10 times [2019-12-18 23:24:36,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:36,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082567196] [2019-12-18 23:24:36,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:37,293 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 23:24:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082567196] [2019-12-18 23:24:37,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:37,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247412941] [2019-12-18 23:24:37,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:37,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:37,297 INFO L87 Difference]: Start difference. First operand 4562 states and 14831 transitions. Second operand 14 states. [2019-12-18 23:24:38,609 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 23:24:39,626 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-12-18 23:24:39,841 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-18 23:24:40,066 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:24:40,381 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-18 23:24:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:40,818 INFO L93 Difference]: Finished difference Result 5362 states and 17081 transitions. [2019-12-18 23:24:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:24:40,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:40,827 INFO L225 Difference]: With dead ends: 5362 [2019-12-18 23:24:40,827 INFO L226 Difference]: Without dead ends: 5362 [2019-12-18 23:24:40,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:24:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2019-12-18 23:24:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4128. [2019-12-18 23:24:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2019-12-18 23:24:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 13467 transitions. [2019-12-18 23:24:40,913 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 13467 transitions. Word has length 25 [2019-12-18 23:24:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 4128 states and 13467 transitions. [2019-12-18 23:24:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 13467 transitions. [2019-12-18 23:24:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:40,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:40,918 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 23:24:40,919 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1866891123, now seen corresponding path program 11 times [2019-12-18 23:24:40,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:40,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142074045] [2019-12-18 23:24:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:41,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142074045] [2019-12-18 23:24:41,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:41,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:41,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144698886] [2019-12-18 23:24:41,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:41,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:41,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:41,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:41,446 INFO L87 Difference]: Start difference. First operand 4128 states and 13467 transitions. Second operand 14 states. [2019-12-18 23:24:42,550 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-18 23:24:42,708 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-18 23:24:42,926 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-18 23:24:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:43,341 INFO L93 Difference]: Finished difference Result 4300 states and 13893 transitions. [2019-12-18 23:24:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:24:43,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:43,348 INFO L225 Difference]: With dead ends: 4300 [2019-12-18 23:24:43,348 INFO L226 Difference]: Without dead ends: 4300 [2019-12-18 23:24:43,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:24:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2019-12-18 23:24:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4190. [2019-12-18 23:24:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-12-18 23:24:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 13663 transitions. [2019-12-18 23:24:43,428 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 13663 transitions. Word has length 25 [2019-12-18 23:24:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 4190 states and 13663 transitions. [2019-12-18 23:24:43,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 13663 transitions. [2019-12-18 23:24:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:43,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:43,435 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 23:24:43,435 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1357919081, now seen corresponding path program 12 times [2019-12-18 23:24:43,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:43,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772401394] [2019-12-18 23:24:43,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:43,947 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 23:24:43,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772401394] [2019-12-18 23:24:43,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:43,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:43,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245267087] [2019-12-18 23:24:43,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:43,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:43,949 INFO L87 Difference]: Start difference. First operand 4190 states and 13663 transitions. Second operand 14 states. [2019-12-18 23:24:44,671 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-18 23:24:45,634 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-18 23:24:45,789 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-18 23:24:45,941 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 23:24:46,119 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-18 23:24:46,385 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-18 23:24:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:46,879 INFO L93 Difference]: Finished difference Result 4806 states and 15495 transitions. [2019-12-18 23:24:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:46,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:46,887 INFO L225 Difference]: With dead ends: 4806 [2019-12-18 23:24:46,887 INFO L226 Difference]: Without dead ends: 4806 [2019-12-18 23:24:46,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-18 23:24:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4514. [2019-12-18 23:24:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-12-18 23:24:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 14689 transitions. [2019-12-18 23:24:46,949 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 14689 transitions. Word has length 25 [2019-12-18 23:24:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:46,949 INFO L462 AbstractCegarLoop]: Abstraction has 4514 states and 14689 transitions. [2019-12-18 23:24:46,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 14689 transitions. [2019-12-18 23:24:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:46,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:46,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:46,955 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash 760849553, now seen corresponding path program 13 times [2019-12-18 23:24:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:46,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462901245] [2019-12-18 23:24:46,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:47,392 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 23:24:47,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462901245] [2019-12-18 23:24:47,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:47,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:47,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474895824] [2019-12-18 23:24:47,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:47,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:47,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:47,394 INFO L87 Difference]: Start difference. First operand 4514 states and 14689 transitions. Second operand 14 states. [2019-12-18 23:24:48,422 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-18 23:24:49,234 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-18 23:24:49,414 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-18 23:24:49,636 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-12-18 23:24:49,808 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 23:24:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:50,240 INFO L93 Difference]: Finished difference Result 4758 states and 15343 transitions. [2019-12-18 23:24:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:50,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:50,247 INFO L225 Difference]: With dead ends: 4758 [2019-12-18 23:24:50,248 INFO L226 Difference]: Without dead ends: 4758 [2019-12-18 23:24:50,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2019-12-18 23:24:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4622. [2019-12-18 23:24:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2019-12-18 23:24:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 15031 transitions. [2019-12-18 23:24:50,308 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 15031 transitions. Word has length 25 [2019-12-18 23:24:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:50,308 INFO L462 AbstractCegarLoop]: Abstraction has 4622 states and 15031 transitions. [2019-12-18 23:24:50,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 15031 transitions. [2019-12-18 23:24:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:50,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:50,314 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 23:24:50,314 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1801502533, now seen corresponding path program 14 times [2019-12-18 23:24:50,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:50,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918071391] [2019-12-18 23:24:50,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:50,959 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 23:24:50,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918071391] [2019-12-18 23:24:50,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:50,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:50,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560232914] [2019-12-18 23:24:50,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:50,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:50,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:50,961 INFO L87 Difference]: Start difference. First operand 4622 states and 15031 transitions. Second operand 14 states. [2019-12-18 23:24:52,483 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 23:24:53,726 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-12-18 23:24:53,982 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-18 23:24:54,290 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-18 23:24:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:54,673 INFO L93 Difference]: Finished difference Result 5362 states and 17161 transitions. [2019-12-18 23:24:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:24:54,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:54,683 INFO L225 Difference]: With dead ends: 5362 [2019-12-18 23:24:54,683 INFO L226 Difference]: Without dead ends: 5362 [2019-12-18 23:24:54,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:24:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2019-12-18 23:24:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4008. [2019-12-18 23:24:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2019-12-18 23:24:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 12977 transitions. [2019-12-18 23:24:54,745 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 12977 transitions. Word has length 25 [2019-12-18 23:24:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:54,745 INFO L462 AbstractCegarLoop]: Abstraction has 4008 states and 12977 transitions. [2019-12-18 23:24:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 12977 transitions. [2019-12-18 23:24:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:54,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:54,751 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 23:24:54,751 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1760795763, now seen corresponding path program 15 times [2019-12-18 23:24:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:54,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244312946] [2019-12-18 23:24:54,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:55,257 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 23:24:55,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244312946] [2019-12-18 23:24:55,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:55,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:55,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284400827] [2019-12-18 23:24:55,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:55,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:55,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:55,259 INFO L87 Difference]: Start difference. First operand 4008 states and 12977 transitions. Second operand 14 states. [2019-12-18 23:24:55,983 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-18 23:24:56,890 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-18 23:24:57,065 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-12-18 23:24:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:57,406 INFO L93 Difference]: Finished difference Result 4274 states and 13692 transitions. [2019-12-18 23:24:57,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:24:57,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:57,413 INFO L225 Difference]: With dead ends: 4274 [2019-12-18 23:24:57,413 INFO L226 Difference]: Without dead ends: 4274 [2019-12-18 23:24:57,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:24:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2019-12-18 23:24:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4274. [2019-12-18 23:24:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-12-18 23:24:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 13692 transitions. [2019-12-18 23:24:57,468 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 13692 transitions. Word has length 25 [2019-12-18 23:24:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:57,468 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 13692 transitions. [2019-12-18 23:24:57,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 13692 transitions. [2019-12-18 23:24:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:57,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:57,473 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 23:24:57,473 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:24:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1163726235, now seen corresponding path program 16 times [2019-12-18 23:24:57,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:57,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462059810] [2019-12-18 23:24:57,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:57,903 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 23:24:57,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462059810] [2019-12-18 23:24:57,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:57,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:57,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223078014] [2019-12-18 23:24:57,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:57,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:57,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:57,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:57,905 INFO L87 Difference]: Start difference. First operand 4274 states and 13692 transitions. Second operand 14 states. [2019-12-18 23:24:58,549 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-12-18 23:24:58,762 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-18 23:24:59,156 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-18 23:25:00,005 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-18 23:25:00,166 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-18 23:25:00,395 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 23:25:00,566 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-18 23:25:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:01,012 INFO L93 Difference]: Finished difference Result 4420 states and 14154 transitions. [2019-12-18 23:25:01,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:25:01,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:25:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:01,019 INFO L225 Difference]: With dead ends: 4420 [2019-12-18 23:25:01,020 INFO L226 Difference]: Without dead ends: 4420 [2019-12-18 23:25:01,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:25:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2019-12-18 23:25:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 4142. [2019-12-18 23:25:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2019-12-18 23:25:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 13274 transitions. [2019-12-18 23:25:01,073 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 13274 transitions. Word has length 25 [2019-12-18 23:25:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:01,074 INFO L462 AbstractCegarLoop]: Abstraction has 4142 states and 13274 transitions. [2019-12-18 23:25:01,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:25:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 13274 transitions. [2019-12-18 23:25:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:01,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:01,080 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 23:25:01,080 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1398625851, now seen corresponding path program 17 times [2019-12-18 23:25:01,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:01,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238545292] [2019-12-18 23:25:01,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:01,664 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 23:25:01,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238545292] [2019-12-18 23:25:01,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:01,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:25:01,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118250288] [2019-12-18 23:25:01,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:25:01,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:25:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:25:01,665 INFO L87 Difference]: Start difference. First operand 4142 states and 13274 transitions. Second operand 14 states. [2019-12-18 23:25:03,511 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-12-18 23:25:04,848 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-12-18 23:25:05,054 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-12-18 23:25:05,224 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-12-18 23:25:05,426 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-18 23:25:05,765 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-12-18 23:25:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:06,192 INFO L93 Difference]: Finished difference Result 4772 states and 15174 transitions. [2019-12-18 23:25:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 23:25:06,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:25:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:06,200 INFO L225 Difference]: With dead ends: 4772 [2019-12-18 23:25:06,200 INFO L226 Difference]: Without dead ends: 4772 [2019-12-18 23:25:06,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=345, Invalid=777, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 23:25:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-12-18 23:25:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 3648. [2019-12-18 23:25:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2019-12-18 23:25:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 11710 transitions. [2019-12-18 23:25:06,249 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 11710 transitions. Word has length 25 [2019-12-18 23:25:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:06,250 INFO L462 AbstractCegarLoop]: Abstraction has 3648 states and 11710 transitions. [2019-12-18 23:25:06,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:25:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 11710 transitions. [2019-12-18 23:25:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:06,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:06,254 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 23:25:06,254 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:06,254 INFO L82 PathProgramCache]: Analyzing trace with hash -255776589, now seen corresponding path program 18 times [2019-12-18 23:25:06,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:06,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194719910] [2019-12-18 23:25:06,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:06,769 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 23:25:06,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194719910] [2019-12-18 23:25:06,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:06,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:25:06,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342313697] [2019-12-18 23:25:06,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:25:06,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:25:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:25:06,771 INFO L87 Difference]: Start difference. First operand 3648 states and 11710 transitions. Second operand 14 states. [2019-12-18 23:25:07,741 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-12-18 23:25:08,527 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-18 23:25:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:08,820 INFO L93 Difference]: Finished difference Result 3662 states and 11754 transitions. [2019-12-18 23:25:08,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:25:08,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:25:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:08,826 INFO L225 Difference]: With dead ends: 3662 [2019-12-18 23:25:08,826 INFO L226 Difference]: Without dead ends: 3662 [2019-12-18 23:25:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:25:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2019-12-18 23:25:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2019-12-18 23:25:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2019-12-18 23:25:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 11754 transitions. [2019-12-18 23:25:08,874 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 11754 transitions. Word has length 25 [2019-12-18 23:25:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:08,874 INFO L462 AbstractCegarLoop]: Abstraction has 3662 states and 11754 transitions. [2019-12-18 23:25:08,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:25:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 11754 transitions. [2019-12-18 23:25:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:08,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:08,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:08,879 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:08,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1476838621, now seen corresponding path program 19 times [2019-12-18 23:25:08,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:08,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356489647] [2019-12-18 23:25:08,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:09,304 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-12-18 23:25:09,453 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 23:25:09,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356489647] [2019-12-18 23:25:09,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:09,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:09,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495164515] [2019-12-18 23:25:09,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:09,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:09,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:09,455 INFO L87 Difference]: Start difference. First operand 3662 states and 11754 transitions. Second operand 13 states. [2019-12-18 23:25:11,113 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-18 23:25:11,292 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-18 23:25:12,701 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-18 23:25:12,972 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-18 23:25:13,287 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-12-18 23:25:13,519 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-18 23:25:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:13,954 INFO L93 Difference]: Finished difference Result 4446 states and 14138 transitions. [2019-12-18 23:25:13,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 23:25:13,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:13,962 INFO L225 Difference]: With dead ends: 4446 [2019-12-18 23:25:13,963 INFO L226 Difference]: Without dead ends: 4446 [2019-12-18 23:25:13,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:25:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-18 23:25:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 3542. [2019-12-18 23:25:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2019-12-18 23:25:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2019-12-18 23:25:14,019 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2019-12-18 23:25:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:14,019 INFO L462 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2019-12-18 23:25:14,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2019-12-18 23:25:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:14,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:14,024 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 23:25:14,024 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1393446354, now seen corresponding path program 5 times [2019-12-18 23:25:14,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:14,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028341122] [2019-12-18 23:25:14,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:14,665 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 23:25:14,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028341122] [2019-12-18 23:25:14,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:14,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:14,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513387237] [2019-12-18 23:25:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:14,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:14,667 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 13 states. [2019-12-18 23:25:15,824 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-18 23:25:15,987 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-18 23:25:16,208 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-18 23:25:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:16,701 INFO L93 Difference]: Finished difference Result 3518 states and 11244 transitions. [2019-12-18 23:25:16,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:25:16,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:16,707 INFO L225 Difference]: With dead ends: 3518 [2019-12-18 23:25:16,707 INFO L226 Difference]: Without dead ends: 3518 [2019-12-18 23:25:16,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:25:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2019-12-18 23:25:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3518. [2019-12-18 23:25:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3518 states. [2019-12-18 23:25:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 11244 transitions. [2019-12-18 23:25:16,750 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 11244 transitions. Word has length 25 [2019-12-18 23:25:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:16,750 INFO L462 AbstractCegarLoop]: Abstraction has 3518 states and 11244 transitions. [2019-12-18 23:25:16,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 11244 transitions. [2019-12-18 23:25:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:16,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:16,753 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 23:25:16,753 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1888828410, now seen corresponding path program 6 times [2019-12-18 23:25:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:16,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749860119] [2019-12-18 23:25:16,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:17,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749860119] [2019-12-18 23:25:17,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:17,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:17,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855257279] [2019-12-18 23:25:17,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:17,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:17,186 INFO L87 Difference]: Start difference. First operand 3518 states and 11244 transitions. Second operand 13 states. [2019-12-18 23:25:18,388 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-12-18 23:25:18,596 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-12-18 23:25:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:18,932 INFO L93 Difference]: Finished difference Result 3833 states and 12261 transitions. [2019-12-18 23:25:18,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:25:18,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:18,938 INFO L225 Difference]: With dead ends: 3833 [2019-12-18 23:25:18,939 INFO L226 Difference]: Without dead ends: 3833 [2019-12-18 23:25:18,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:25:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2019-12-18 23:25:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3714. [2019-12-18 23:25:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2019-12-18 23:25:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 11902 transitions. [2019-12-18 23:25:18,993 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 11902 transitions. Word has length 25 [2019-12-18 23:25:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:18,993 INFO L462 AbstractCegarLoop]: Abstraction has 3714 states and 11902 transitions. [2019-12-18 23:25:18,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 11902 transitions. [2019-12-18 23:25:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:18,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:18,997 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 23:25:18,997 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1830938634, now seen corresponding path program 7 times [2019-12-18 23:25:18,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:18,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058050576] [2019-12-18 23:25:18,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:19,531 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 23:25:19,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058050576] [2019-12-18 23:25:19,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:19,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:19,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934670893] [2019-12-18 23:25:19,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:19,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:19,533 INFO L87 Difference]: Start difference. First operand 3714 states and 11902 transitions. Second operand 13 states. [2019-12-18 23:25:20,602 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-18 23:25:21,687 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-12-18 23:25:21,964 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-18 23:25:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:22,265 INFO L93 Difference]: Finished difference Result 4354 states and 13762 transitions. [2019-12-18 23:25:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:22,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:22,272 INFO L225 Difference]: With dead ends: 4354 [2019-12-18 23:25:22,272 INFO L226 Difference]: Without dead ends: 4354 [2019-12-18 23:25:22,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:25:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2019-12-18 23:25:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3406. [2019-12-18 23:25:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2019-12-18 23:25:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 10906 transitions. [2019-12-18 23:25:22,320 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 10906 transitions. Word has length 25 [2019-12-18 23:25:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:22,320 INFO L462 AbstractCegarLoop]: Abstraction has 3406 states and 10906 transitions. [2019-12-18 23:25:22,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 10906 transitions. [2019-12-18 23:25:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:22,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:22,323 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 23:25:22,323 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:22,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash -729745196, now seen corresponding path program 8 times [2019-12-18 23:25:22,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:22,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657446885] [2019-12-18 23:25:22,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:22,773 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 23:25:22,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657446885] [2019-12-18 23:25:22,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:22,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850285135] [2019-12-18 23:25:22,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:22,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:22,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:22,775 INFO L87 Difference]: Start difference. First operand 3406 states and 10906 transitions. Second operand 13 states. [2019-12-18 23:25:23,886 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-18 23:25:24,050 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-18 23:25:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:24,384 INFO L93 Difference]: Finished difference Result 3441 states and 11013 transitions. [2019-12-18 23:25:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:25:24,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:24,390 INFO L225 Difference]: With dead ends: 3441 [2019-12-18 23:25:24,390 INFO L226 Difference]: Without dead ends: 3441 [2019-12-18 23:25:24,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:25:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2019-12-18 23:25:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3434. [2019-12-18 23:25:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-12-18 23:25:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 10992 transitions. [2019-12-18 23:25:24,442 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 10992 transitions. Word has length 25 [2019-12-18 23:25:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:24,443 INFO L462 AbstractCegarLoop]: Abstraction has 3434 states and 10992 transitions. [2019-12-18 23:25:24,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 10992 transitions. [2019-12-18 23:25:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:24,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:24,447 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 23:25:24,447 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -787634972, now seen corresponding path program 9 times [2019-12-18 23:25:24,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:24,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399850087] [2019-12-18 23:25:24,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:24,947 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 23:25:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399850087] [2019-12-18 23:25:24,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492101052] [2019-12-18 23:25:24,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:24,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:24,949 INFO L87 Difference]: Start difference. First operand 3434 states and 10992 transitions. Second operand 13 states. [2019-12-18 23:25:26,061 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-18 23:25:27,248 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-18 23:25:27,493 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-18 23:25:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:27,832 INFO L93 Difference]: Finished difference Result 4214 states and 13342 transitions. [2019-12-18 23:25:27,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:27,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:27,838 INFO L225 Difference]: With dead ends: 4214 [2019-12-18 23:25:27,838 INFO L226 Difference]: Without dead ends: 4214 [2019-12-18 23:25:27,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=223, Invalid=479, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-12-18 23:25:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 3266. [2019-12-18 23:25:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2019-12-18 23:25:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 10486 transitions. [2019-12-18 23:25:27,882 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 10486 transitions. Word has length 25 [2019-12-18 23:25:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:27,883 INFO L462 AbstractCegarLoop]: Abstraction has 3266 states and 10486 transitions. [2019-12-18 23:25:27,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 10486 transitions. [2019-12-18 23:25:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:27,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:27,885 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 23:25:27,885 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 9690196, now seen corresponding path program 10 times [2019-12-18 23:25:27,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:27,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880480128] [2019-12-18 23:25:27,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:28,321 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 23:25:28,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880480128] [2019-12-18 23:25:28,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:25:28,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866690853] [2019-12-18 23:25:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:25:28,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:28,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:25:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:25:28,324 INFO L87 Difference]: Start difference. First operand 3266 states and 10486 transitions. Second operand 13 states. [2019-12-18 23:25:30,454 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-18 23:25:30,671 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-18 23:25:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:30,930 INFO L93 Difference]: Finished difference Result 3990 states and 12613 transitions. [2019-12-18 23:25:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:30,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:25:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:30,937 INFO L225 Difference]: With dead ends: 3990 [2019-12-18 23:25:30,937 INFO L226 Difference]: Without dead ends: 3990 [2019-12-18 23:25:30,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-12-18 23:25:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3140. [2019-12-18 23:25:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-12-18 23:25:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 10033 transitions. [2019-12-18 23:25:30,986 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 10033 transitions. Word has length 25 [2019-12-18 23:25:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:30,987 INFO L462 AbstractCegarLoop]: Abstraction has 3140 states and 10033 transitions. [2019-12-18 23:25:30,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:25:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 10033 transitions. [2019-12-18 23:25:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:30,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:30,990 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 23:25:30,990 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1683232533, now seen corresponding path program 1 times [2019-12-18 23:25:30,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:30,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034328407] [2019-12-18 23:25:30,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:31,844 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 23:25:31,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034328407] [2019-12-18 23:25:31,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:31,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:25:31,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861374249] [2019-12-18 23:25:31,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:25:31,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:25:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:25:31,846 INFO L87 Difference]: Start difference. First operand 3140 states and 10033 transitions. Second operand 17 states. [2019-12-18 23:25:33,056 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-12-18 23:25:33,234 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-12-18 23:25:33,499 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:25:33,723 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-12-18 23:25:33,992 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-18 23:25:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:35,236 INFO L93 Difference]: Finished difference Result 4731 states and 15291 transitions. [2019-12-18 23:25:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:35,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:25:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:35,244 INFO L225 Difference]: With dead ends: 4731 [2019-12-18 23:25:35,244 INFO L226 Difference]: Without dead ends: 4731 [2019-12-18 23:25:35,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-12-18 23:25:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 3694. [2019-12-18 23:25:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3694 states. [2019-12-18 23:25:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 11920 transitions. [2019-12-18 23:25:35,299 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 11920 transitions. Word has length 27 [2019-12-18 23:25:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:35,299 INFO L462 AbstractCegarLoop]: Abstraction has 3694 states and 11920 transitions. [2019-12-18 23:25:35,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:25:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 11920 transitions. [2019-12-18 23:25:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:35,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:35,302 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 23:25:35,303 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1683232537, now seen corresponding path program 1 times [2019-12-18 23:25:35,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:35,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191661337] [2019-12-18 23:25:35,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:35,996 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2019-12-18 23:25:36,268 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 23:25:36,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191661337] [2019-12-18 23:25:36,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:36,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:25:36,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011976291] [2019-12-18 23:25:36,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:25:36,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:25:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:25:36,270 INFO L87 Difference]: Start difference. First operand 3694 states and 11920 transitions. Second operand 17 states. [2019-12-18 23:25:37,486 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-18 23:25:37,696 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-12-18 23:25:37,963 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 23:25:38,189 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-18 23:25:38,456 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-18 23:25:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:39,688 INFO L93 Difference]: Finished difference Result 5160 states and 16593 transitions. [2019-12-18 23:25:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:39,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:25:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:39,696 INFO L225 Difference]: With dead ends: 5160 [2019-12-18 23:25:39,697 INFO L226 Difference]: Without dead ends: 5160 [2019-12-18 23:25:39,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2019-12-18 23:25:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 3694. [2019-12-18 23:25:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3694 states. [2019-12-18 23:25:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 11827 transitions. [2019-12-18 23:25:39,749 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 11827 transitions. Word has length 27 [2019-12-18 23:25:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:39,749 INFO L462 AbstractCegarLoop]: Abstraction has 3694 states and 11827 transitions. [2019-12-18 23:25:39,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:25:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 11827 transitions. [2019-12-18 23:25:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:39,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:39,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 23:25:39,752 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1341619379, now seen corresponding path program 1 times [2019-12-18 23:25:39,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:39,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975677904] [2019-12-18 23:25:39,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:40,389 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-12-18 23:25:40,642 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 23:25:40,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975677904] [2019-12-18 23:25:40,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:40,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:40,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26123640] [2019-12-18 23:25:40,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:40,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:40,644 INFO L87 Difference]: Start difference. First operand 3694 states and 11827 transitions. Second operand 16 states. [2019-12-18 23:25:41,758 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-18 23:25:42,005 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 23:25:42,225 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 23:25:42,445 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-12-18 23:25:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:43,645 INFO L93 Difference]: Finished difference Result 5423 states and 17580 transitions. [2019-12-18 23:25:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:43,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:43,653 INFO L225 Difference]: With dead ends: 5423 [2019-12-18 23:25:43,653 INFO L226 Difference]: Without dead ends: 5423 [2019-12-18 23:25:43,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2019-12-18 23:25:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4261. [2019-12-18 23:25:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-12-18 23:25:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 13751 transitions. [2019-12-18 23:25:43,763 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 13751 transitions. Word has length 27 [2019-12-18 23:25:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:43,763 INFO L462 AbstractCegarLoop]: Abstraction has 4261 states and 13751 transitions. [2019-12-18 23:25:43,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 13751 transitions. [2019-12-18 23:25:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:43,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:43,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:43,766 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1341619383, now seen corresponding path program 1 times [2019-12-18 23:25:43,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:43,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076508979] [2019-12-18 23:25:43,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:44,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076508979] [2019-12-18 23:25:44,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:44,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:44,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369780159] [2019-12-18 23:25:44,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:44,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:44,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:44,627 INFO L87 Difference]: Start difference. First operand 4261 states and 13751 transitions. Second operand 16 states. [2019-12-18 23:25:45,810 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-18 23:25:46,064 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-18 23:25:46,276 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-18 23:25:46,502 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-18 23:25:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:47,809 INFO L93 Difference]: Finished difference Result 5330 states and 17233 transitions. [2019-12-18 23:25:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:47,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:47,818 INFO L225 Difference]: With dead ends: 5330 [2019-12-18 23:25:47,818 INFO L226 Difference]: Without dead ends: 5330 [2019-12-18 23:25:47,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2019-12-18 23:25:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 3937. [2019-12-18 23:25:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-12-18 23:25:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 12581 transitions. [2019-12-18 23:25:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 12581 transitions. Word has length 27 [2019-12-18 23:25:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:47,879 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 12581 transitions. [2019-12-18 23:25:47,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 12581 transitions. [2019-12-18 23:25:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:47,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:47,882 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 23:25:47,882 INFO L410 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -65867347, now seen corresponding path program 2 times [2019-12-18 23:25:47,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:47,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170904755] [2019-12-18 23:25:47,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:48,586 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2019-12-18 23:25:48,875 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 23:25:48,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170904755] [2019-12-18 23:25:48,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:48,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:25:48,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220136131] [2019-12-18 23:25:48,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:25:48,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:25:48,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:25:48,877 INFO L87 Difference]: Start difference. First operand 3937 states and 12581 transitions. Second operand 17 states. [2019-12-18 23:25:50,258 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-12-18 23:25:50,427 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 23:25:50,662 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 23:25:50,875 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-18 23:25:51,129 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-18 23:25:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:52,524 INFO L93 Difference]: Finished difference Result 6216 states and 20057 transitions. [2019-12-18 23:25:52,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:52,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:25:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:52,534 INFO L225 Difference]: With dead ends: 6216 [2019-12-18 23:25:52,534 INFO L226 Difference]: Without dead ends: 6216 [2019-12-18 23:25:52,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:52,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2019-12-18 23:25:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 4535. [2019-12-18 23:25:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2019-12-18 23:25:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 14600 transitions. [2019-12-18 23:25:52,598 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 14600 transitions. Word has length 27 [2019-12-18 23:25:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:52,598 INFO L462 AbstractCegarLoop]: Abstraction has 4535 states and 14600 transitions. [2019-12-18 23:25:52,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:25:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 14600 transitions. [2019-12-18 23:25:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:52,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:52,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] [2019-12-18 23:25:52,602 INFO L410 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash -65867343, now seen corresponding path program 2 times [2019-12-18 23:25:52,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:52,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089122258] [2019-12-18 23:25:52,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:53,434 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 23:25:53,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089122258] [2019-12-18 23:25:53,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:53,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:25:53,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757071665] [2019-12-18 23:25:53,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:25:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:25:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:25:53,436 INFO L87 Difference]: Start difference. First operand 4535 states and 14600 transitions. Second operand 17 states. [2019-12-18 23:25:54,709 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-12-18 23:25:54,881 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:25:55,118 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 23:25:55,333 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 23:25:55,574 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-12-18 23:25:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:56,824 INFO L93 Difference]: Finished difference Result 6645 states and 21359 transitions. [2019-12-18 23:25:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:56,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:25:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:56,834 INFO L225 Difference]: With dead ends: 6645 [2019-12-18 23:25:56,834 INFO L226 Difference]: Without dead ends: 6645 [2019-12-18 23:25:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2019-12-18 23:25:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 4003. [2019-12-18 23:25:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4003 states. [2019-12-18 23:25:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 12779 transitions. [2019-12-18 23:25:56,893 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 12779 transitions. Word has length 27 [2019-12-18 23:25:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:56,893 INFO L462 AbstractCegarLoop]: Abstraction has 4003 states and 12779 transitions. [2019-12-18 23:25:56,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:25:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 12779 transitions. [2019-12-18 23:25:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:56,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:56,896 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 23:25:56,896 INFO L410 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:25:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 438272035, now seen corresponding path program 3 times [2019-12-18 23:25:56,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:56,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971857599] [2019-12-18 23:25:56,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:57,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 23:25:57,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971857599] [2019-12-18 23:25:57,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:57,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:57,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624489668] [2019-12-18 23:25:57,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:57,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:57,748 INFO L87 Difference]: Start difference. First operand 4003 states and 12779 transitions. Second operand 16 states. [2019-12-18 23:25:58,441 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-12-18 23:25:58,778 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-12-18 23:25:59,029 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-12-18 23:25:59,312 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-12-18 23:26:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:00,927 INFO L93 Difference]: Finished difference Result 6699 states and 21598 transitions. [2019-12-18 23:26:00,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:26:00,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:26:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:00,945 INFO L225 Difference]: With dead ends: 6699 [2019-12-18 23:26:00,946 INFO L226 Difference]: Without dead ends: 6699 [2019-12-18 23:26:00,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:26:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2019-12-18 23:26:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 4693. [2019-12-18 23:26:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4693 states. [2019-12-18 23:26:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4693 states to 4693 states and 14953 transitions. [2019-12-18 23:26:01,020 INFO L78 Accepts]: Start accepts. Automaton has 4693 states and 14953 transitions. Word has length 27 [2019-12-18 23:26:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:01,021 INFO L462 AbstractCegarLoop]: Abstraction has 4693 states and 14953 transitions. [2019-12-18 23:26:01,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:26:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4693 states and 14953 transitions. [2019-12-18 23:26:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:01,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:01,025 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 23:26:01,025 INFO L410 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash 332696225, now seen corresponding path program 2 times [2019-12-18 23:26:01,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:01,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039262344] [2019-12-18 23:26:01,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:01,677 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 37 [2019-12-18 23:26:02,046 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 23:26:02,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039262344] [2019-12-18 23:26:02,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:02,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:26:02,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143673582] [2019-12-18 23:26:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:26:02,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:26:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:26:02,048 INFO L87 Difference]: Start difference. First operand 4693 states and 14953 transitions. Second operand 16 states. [2019-12-18 23:26:03,261 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-18 23:26:03,475 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 23:26:03,675 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-18 23:26:03,899 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-18 23:26:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:05,197 INFO L93 Difference]: Finished difference Result 7428 states and 23812 transitions. [2019-12-18 23:26:05,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:26:05,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:26:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:05,209 INFO L225 Difference]: With dead ends: 7428 [2019-12-18 23:26:05,209 INFO L226 Difference]: Without dead ends: 7428 [2019-12-18 23:26:05,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:26:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2019-12-18 23:26:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 4750. [2019-12-18 23:26:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-12-18 23:26:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 15124 transitions. [2019-12-18 23:26:05,284 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 15124 transitions. Word has length 27 [2019-12-18 23:26:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:05,284 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 15124 transitions. [2019-12-18 23:26:05,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:26:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 15124 transitions. [2019-12-18 23:26:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:05,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:05,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] [2019-12-18 23:26:05,288 INFO L410 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2092749165, now seen corresponding path program 3 times [2019-12-18 23:26:05,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:05,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604081738] [2019-12-18 23:26:05,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:06,036 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 38 [2019-12-18 23:26:06,400 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 23:26:06,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604081738] [2019-12-18 23:26:06,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:06,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:26:06,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661872777] [2019-12-18 23:26:06,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:26:06,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:26:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:26:06,403 INFO L87 Difference]: Start difference. First operand 4750 states and 15124 transitions. Second operand 16 states. [2019-12-18 23:26:07,865 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 23:26:08,052 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-18 23:26:08,251 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-18 23:26:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:09,577 INFO L93 Difference]: Finished difference Result 7324 states and 23500 transitions. [2019-12-18 23:26:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:26:09,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:26:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:09,591 INFO L225 Difference]: With dead ends: 7324 [2019-12-18 23:26:09,591 INFO L226 Difference]: Without dead ends: 7324 [2019-12-18 23:26:09,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:26:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-12-18 23:26:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 4921. [2019-12-18 23:26:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2019-12-18 23:26:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 15637 transitions. [2019-12-18 23:26:09,672 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 15637 transitions. Word has length 27 [2019-12-18 23:26:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:09,672 INFO L462 AbstractCegarLoop]: Abstraction has 4921 states and 15637 transitions. [2019-12-18 23:26:09,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:26:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 15637 transitions. [2019-12-18 23:26:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:09,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:09,677 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 23:26:09,677 INFO L410 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash -646098017, now seen corresponding path program 4 times [2019-12-18 23:26:09,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:09,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347399262] [2019-12-18 23:26:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:10,361 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 23:26:10,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347399262] [2019-12-18 23:26:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:10,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:26:10,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062243486] [2019-12-18 23:26:10,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:26:10,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:26:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:26:10,363 INFO L87 Difference]: Start difference. First operand 4921 states and 15637 transitions. Second operand 15 states. [2019-12-18 23:26:11,218 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-12-18 23:26:11,456 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:26:11,702 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-18 23:26:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:13,245 INFO L93 Difference]: Finished difference Result 7403 states and 23814 transitions. [2019-12-18 23:26:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:26:13,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:26:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:13,256 INFO L225 Difference]: With dead ends: 7403 [2019-12-18 23:26:13,256 INFO L226 Difference]: Without dead ends: 7403 [2019-12-18 23:26:13,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:26:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2019-12-18 23:26:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 5114. [2019-12-18 23:26:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5114 states. [2019-12-18 23:26:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 16250 transitions. [2019-12-18 23:26:13,329 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 16250 transitions. Word has length 27 [2019-12-18 23:26:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:13,329 INFO L462 AbstractCegarLoop]: Abstraction has 5114 states and 16250 transitions. [2019-12-18 23:26:13,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:26:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 16250 transitions. [2019-12-18 23:26:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:13,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:13,334 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 23:26:13,334 INFO L410 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1165102133, now seen corresponding path program 4 times [2019-12-18 23:26:13,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:13,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988097191] [2019-12-18 23:26:13,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:13,905 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 28 [2019-12-18 23:26:14,176 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 23:26:14,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988097191] [2019-12-18 23:26:14,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:14,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:14,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111393122] [2019-12-18 23:26:14,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:14,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:14,178 INFO L87 Difference]: Start difference. First operand 5114 states and 16250 transitions. Second operand 17 states. [2019-12-18 23:26:15,469 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-12-18 23:26:15,645 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-12-18 23:26:15,895 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-12-18 23:26:16,120 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 23:26:16,378 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 23:26:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:17,790 INFO L93 Difference]: Finished difference Result 6850 states and 22026 transitions. [2019-12-18 23:26:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:17,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:17,801 INFO L225 Difference]: With dead ends: 6850 [2019-12-18 23:26:17,801 INFO L226 Difference]: Without dead ends: 6850 [2019-12-18 23:26:17,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2019-12-18 23:26:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 5657. [2019-12-18 23:26:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5657 states. [2019-12-18 23:26:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 18104 transitions. [2019-12-18 23:26:17,893 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 18104 transitions. Word has length 27 [2019-12-18 23:26:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:17,893 INFO L462 AbstractCegarLoop]: Abstraction has 5657 states and 18104 transitions. [2019-12-18 23:26:17,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 18104 transitions. [2019-12-18 23:26:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:17,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:17,901 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 23:26:17,901 INFO L410 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:17,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1165102137, now seen corresponding path program 3 times [2019-12-18 23:26:17,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:17,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195474639] [2019-12-18 23:26:17,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:18,758 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 23:26:18,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195474639] [2019-12-18 23:26:18,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:18,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:18,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232430961] [2019-12-18 23:26:18,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:18,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:18,760 INFO L87 Difference]: Start difference. First operand 5657 states and 18104 transitions. Second operand 17 states. [2019-12-18 23:26:20,093 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-18 23:26:20,281 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-12-18 23:26:20,586 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-18 23:26:20,830 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 23:26:21,102 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-18 23:26:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:22,658 INFO L93 Difference]: Finished difference Result 6757 states and 21679 transitions. [2019-12-18 23:26:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 23:26:22,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:22,672 INFO L225 Difference]: With dead ends: 6757 [2019-12-18 23:26:22,673 INFO L226 Difference]: Without dead ends: 6757 [2019-12-18 23:26:22,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:26:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-12-18 23:26:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5163. [2019-12-18 23:26:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5163 states. [2019-12-18 23:26:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 16397 transitions. [2019-12-18 23:26:22,758 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 16397 transitions. Word has length 27 [2019-12-18 23:26:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:22,758 INFO L462 AbstractCegarLoop]: Abstraction has 5163 states and 16397 transitions. [2019-12-18 23:26:22,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 16397 transitions. [2019-12-18 23:26:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:22,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:22,763 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 23:26:22,763 INFO L410 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -583997747, now seen corresponding path program 5 times [2019-12-18 23:26:22,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:22,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857728678] [2019-12-18 23:26:22,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:23,363 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2019-12-18 23:26:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:23,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857728678] [2019-12-18 23:26:23,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:23,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:23,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314503790] [2019-12-18 23:26:23,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:23,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:23,649 INFO L87 Difference]: Start difference. First operand 5163 states and 16397 transitions. Second operand 17 states. [2019-12-18 23:26:25,028 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-12-18 23:26:25,199 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 23:26:25,438 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-18 23:26:25,664 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 23:26:25,924 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-12-18 23:26:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:27,200 INFO L93 Difference]: Finished difference Result 7679 states and 24584 transitions. [2019-12-18 23:26:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:27,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:27,212 INFO L225 Difference]: With dead ends: 7679 [2019-12-18 23:26:27,212 INFO L226 Difference]: Without dead ends: 7679 [2019-12-18 23:26:27,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7679 states. [2019-12-18 23:26:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7679 to 5794. [2019-12-18 23:26:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5794 states. [2019-12-18 23:26:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5794 states to 5794 states and 18515 transitions. [2019-12-18 23:26:27,292 INFO L78 Accepts]: Start accepts. Automaton has 5794 states and 18515 transitions. Word has length 27 [2019-12-18 23:26:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:27,292 INFO L462 AbstractCegarLoop]: Abstraction has 5794 states and 18515 transitions. [2019-12-18 23:26:27,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5794 states and 18515 transitions. [2019-12-18 23:26:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:27,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:27,299 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 23:26:27,299 INFO L410 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash -583997743, now seen corresponding path program 4 times [2019-12-18 23:26:27,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:27,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969070253] [2019-12-18 23:26:27,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:28,000 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-12-18 23:26:28,254 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 23:26:28,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969070253] [2019-12-18 23:26:28,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:28,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:28,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794483612] [2019-12-18 23:26:28,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:28,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:28,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:28,256 INFO L87 Difference]: Start difference. First operand 5794 states and 18515 transitions. Second operand 17 states. [2019-12-18 23:26:29,636 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-12-18 23:26:29,812 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 23:26:30,066 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-18 23:26:30,287 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 23:26:30,535 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-18 23:26:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:31,792 INFO L93 Difference]: Finished difference Result 8108 states and 25886 transitions. [2019-12-18 23:26:31,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:31,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:31,807 INFO L225 Difference]: With dead ends: 8108 [2019-12-18 23:26:31,807 INFO L226 Difference]: Without dead ends: 8108 [2019-12-18 23:26:31,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2019-12-18 23:26:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 5262. [2019-12-18 23:26:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2019-12-18 23:26:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 16694 transitions. [2019-12-18 23:26:31,929 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 16694 transitions. Word has length 27 [2019-12-18 23:26:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:31,930 INFO L462 AbstractCegarLoop]: Abstraction has 5262 states and 16694 transitions. [2019-12-18 23:26:31,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 16694 transitions. [2019-12-18 23:26:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:31,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:31,934 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 23:26:31,934 INFO L410 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:31,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash -79858365, now seen corresponding path program 6 times [2019-12-18 23:26:31,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:31,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584255894] [2019-12-18 23:26:31,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:32,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584255894] [2019-12-18 23:26:32,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:32,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:26:32,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805198655] [2019-12-18 23:26:32,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:26:32,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:26:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:26:32,663 INFO L87 Difference]: Start difference. First operand 5262 states and 16694 transitions. Second operand 16 states. [2019-12-18 23:26:33,388 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-12-18 23:26:33,717 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:26:33,969 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:26:34,263 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:26:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:35,926 INFO L93 Difference]: Finished difference Result 8284 states and 26518 transitions. [2019-12-18 23:26:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:26:35,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:26:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:35,938 INFO L225 Difference]: With dead ends: 8284 [2019-12-18 23:26:35,938 INFO L226 Difference]: Without dead ends: 8284 [2019-12-18 23:26:35,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:26:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2019-12-18 23:26:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 5304. [2019-12-18 23:26:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-12-18 23:26:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 16820 transitions. [2019-12-18 23:26:36,041 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 16820 transitions. Word has length 27 [2019-12-18 23:26:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:36,041 INFO L462 AbstractCegarLoop]: Abstraction has 5304 states and 16820 transitions. [2019-12-18 23:26:36,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:26:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 16820 transitions. [2019-12-18 23:26:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:36,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:36,046 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 23:26:36,046 INFO L410 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1834625615, now seen corresponding path program 7 times [2019-12-18 23:26:36,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:36,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55144444] [2019-12-18 23:26:36,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:36,676 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2019-12-18 23:26:36,966 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 23:26:36,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55144444] [2019-12-18 23:26:36,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:36,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:36,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113878894] [2019-12-18 23:26:36,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:36,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:36,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:36,967 INFO L87 Difference]: Start difference. First operand 5304 states and 16820 transitions. Second operand 17 states. [2019-12-18 23:26:38,355 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-12-18 23:26:38,531 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-18 23:26:38,774 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 23:26:38,998 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-12-18 23:26:39,248 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 23:26:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:40,608 INFO L93 Difference]: Finished difference Result 6358 states and 20467 transitions. [2019-12-18 23:26:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:40,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:40,618 INFO L225 Difference]: With dead ends: 6358 [2019-12-18 23:26:40,618 INFO L226 Difference]: Without dead ends: 6358 [2019-12-18 23:26:40,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2019-12-18 23:26:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 5709. [2019-12-18 23:26:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-12-18 23:26:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 18260 transitions. [2019-12-18 23:26:40,687 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 18260 transitions. Word has length 27 [2019-12-18 23:26:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:40,687 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 18260 transitions. [2019-12-18 23:26:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 18260 transitions. [2019-12-18 23:26:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:40,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:40,692 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 23:26:40,692 INFO L410 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1834625619, now seen corresponding path program 5 times [2019-12-18 23:26:40,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:40,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578949357] [2019-12-18 23:26:40,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:41,318 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-12-18 23:26:41,594 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 23:26:41,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578949357] [2019-12-18 23:26:41,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:41,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:41,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207190746] [2019-12-18 23:26:41,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:41,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:41,596 INFO L87 Difference]: Start difference. First operand 5709 states and 18260 transitions. Second operand 17 states. [2019-12-18 23:26:43,069 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-12-18 23:26:43,241 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:26:43,473 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-12-18 23:26:43,681 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-18 23:26:43,923 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-18 23:26:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:45,296 INFO L93 Difference]: Finished difference Result 6787 states and 21769 transitions. [2019-12-18 23:26:45,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:45,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:45,306 INFO L225 Difference]: With dead ends: 6787 [2019-12-18 23:26:45,307 INFO L226 Difference]: Without dead ends: 6787 [2019-12-18 23:26:45,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2019-12-18 23:26:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 5177. [2019-12-18 23:26:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-12-18 23:26:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 16439 transitions. [2019-12-18 23:26:45,386 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 16439 transitions. Word has length 27 [2019-12-18 23:26:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:45,386 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 16439 transitions. [2019-12-18 23:26:45,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 16439 transitions. [2019-12-18 23:26:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:45,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:45,391 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 23:26:45,391 INFO L410 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1956202299, now seen corresponding path program 8 times [2019-12-18 23:26:45,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:45,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230659590] [2019-12-18 23:26:45,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:46,120 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 23:26:46,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230659590] [2019-12-18 23:26:46,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:46,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:26:46,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018018484] [2019-12-18 23:26:46,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:26:46,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:26:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:26:46,121 INFO L87 Difference]: Start difference. First operand 5177 states and 16439 transitions. Second operand 16 states. [2019-12-18 23:26:46,863 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-12-18 23:26:47,206 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:26:47,464 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:26:47,800 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:26:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:49,540 INFO L93 Difference]: Finished difference Result 8237 states and 26377 transitions. [2019-12-18 23:26:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:26:49,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:26:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:49,553 INFO L225 Difference]: With dead ends: 8237 [2019-12-18 23:26:49,553 INFO L226 Difference]: Without dead ends: 8237 [2019-12-18 23:26:49,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:26:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2019-12-18 23:26:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 5078. [2019-12-18 23:26:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5078 states. [2019-12-18 23:26:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 16142 transitions. [2019-12-18 23:26:49,635 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 16142 transitions. Word has length 27 [2019-12-18 23:26:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:49,635 INFO L462 AbstractCegarLoop]: Abstraction has 5078 states and 16142 transitions. [2019-12-18 23:26:49,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:26:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 16142 transitions. [2019-12-18 23:26:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:49,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:49,639 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 23:26:49,639 INFO L410 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1338767537, now seen corresponding path program 9 times [2019-12-18 23:26:49,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:49,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475980220] [2019-12-18 23:26:49,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:50,503 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 23:26:50,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475980220] [2019-12-18 23:26:50,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:50,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:50,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353166995] [2019-12-18 23:26:50,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:50,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:50,505 INFO L87 Difference]: Start difference. First operand 5078 states and 16142 transitions. Second operand 17 states. [2019-12-18 23:26:51,293 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-12-18 23:26:51,609 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:26:51,875 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:26:52,208 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 23:26:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:53,998 INFO L93 Difference]: Finished difference Result 7265 states and 23375 transitions. [2019-12-18 23:26:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:53,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:54,010 INFO L225 Difference]: With dead ends: 7265 [2019-12-18 23:26:54,010 INFO L226 Difference]: Without dead ends: 7265 [2019-12-18 23:26:54,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2019-12-18 23:26:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 6138. [2019-12-18 23:26:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-12-18 23:26:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 19651 transitions. [2019-12-18 23:26:54,103 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 19651 transitions. Word has length 27 [2019-12-18 23:26:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:54,103 INFO L462 AbstractCegarLoop]: Abstraction has 6138 states and 19651 transitions. [2019-12-18 23:26:54,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 19651 transitions. [2019-12-18 23:26:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:54,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:54,109 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 23:26:54,109 INFO L410 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1338767533, now seen corresponding path program 6 times [2019-12-18 23:26:54,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:54,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344404401] [2019-12-18 23:26:54,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:54,687 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-12-18 23:26:54,951 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 23:26:54,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344404401] [2019-12-18 23:26:54,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:54,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:26:54,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162379234] [2019-12-18 23:26:54,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:26:54,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:26:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:26:54,953 INFO L87 Difference]: Start difference. First operand 6138 states and 19651 transitions. Second operand 17 states. [2019-12-18 23:26:55,628 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-12-18 23:26:55,823 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-12-18 23:26:56,201 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-18 23:26:56,478 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:26:56,828 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:26:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:58,793 INFO L93 Difference]: Finished difference Result 7172 states and 23028 transitions. [2019-12-18 23:26:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:26:58,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:26:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:58,804 INFO L225 Difference]: With dead ends: 7172 [2019-12-18 23:26:58,804 INFO L226 Difference]: Without dead ends: 7172 [2019-12-18 23:26:58,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:26:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7172 states. [2019-12-18 23:26:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7172 to 4748. [2019-12-18 23:26:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-12-18 23:26:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 15152 transitions. [2019-12-18 23:26:58,880 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 15152 transitions. Word has length 27 [2019-12-18 23:26:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:58,880 INFO L462 AbstractCegarLoop]: Abstraction has 4748 states and 15152 transitions. [2019-12-18 23:26:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:26:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 15152 transitions. [2019-12-18 23:26:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:26:58,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:58,885 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 23:26:58,885 INFO L410 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:26:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2060419983, now seen corresponding path program 10 times [2019-12-18 23:26:58,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:58,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515658514] [2019-12-18 23:26:58,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:59,348 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 32 [2019-12-18 23:26:59,740 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 23:26:59,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515658514] [2019-12-18 23:26:59,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:59,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:26:59,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754572817] [2019-12-18 23:26:59,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:26:59,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:59,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:26:59,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:26:59,741 INFO L87 Difference]: Start difference. First operand 4748 states and 15152 transitions. Second operand 16 states. [2019-12-18 23:27:00,855 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 23:27:01,141 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:27:01,495 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:27:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:03,650 INFO L93 Difference]: Finished difference Result 6732 states and 21708 transitions. [2019-12-18 23:27:03,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:27:03,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:03,661 INFO L225 Difference]: With dead ends: 6732 [2019-12-18 23:27:03,661 INFO L226 Difference]: Without dead ends: 6732 [2019-12-18 23:27:03,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:27:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2019-12-18 23:27:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 4638. [2019-12-18 23:27:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4638 states. [2019-12-18 23:27:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 14822 transitions. [2019-12-18 23:27:03,732 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 14822 transitions. Word has length 27 [2019-12-18 23:27:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:03,732 INFO L462 AbstractCegarLoop]: Abstraction has 4638 states and 14822 transitions. [2019-12-18 23:27:03,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 14822 transitions. [2019-12-18 23:27:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:03,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:03,736 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 23:27:03,737 INFO L410 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1906370165, now seen corresponding path program 11 times [2019-12-18 23:27:03,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:03,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261115785] [2019-12-18 23:27:03,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:04,180 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2019-12-18 23:27:04,474 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-12-18 23:27:04,613 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2019-12-18 23:27:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:04,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261115785] [2019-12-18 23:27:04,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:04,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 23:27:04,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832135456] [2019-12-18 23:27:04,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:27:04,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:27:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:27:04,758 INFO L87 Difference]: Start difference. First operand 4638 states and 14822 transitions. Second operand 18 states. [2019-12-18 23:27:06,107 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-18 23:27:07,444 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 23:27:07,650 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-18 23:27:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:09,016 INFO L93 Difference]: Finished difference Result 6562 states and 21193 transitions. [2019-12-18 23:27:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:27:09,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-12-18 23:27:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:09,026 INFO L225 Difference]: With dead ends: 6562 [2019-12-18 23:27:09,026 INFO L226 Difference]: Without dead ends: 6562 [2019-12-18 23:27:09,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:27:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2019-12-18 23:27:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 4498. [2019-12-18 23:27:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2019-12-18 23:27:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 14382 transitions. [2019-12-18 23:27:09,095 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 14382 transitions. Word has length 27 [2019-12-18 23:27:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:09,095 INFO L462 AbstractCegarLoop]: Abstraction has 4498 states and 14382 transitions. [2019-12-18 23:27:09,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:27:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 14382 transitions. [2019-12-18 23:27:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:09,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:09,099 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 23:27:09,099 INFO L410 AbstractCegarLoop]: === Iteration 55 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1627488203, now seen corresponding path program 12 times [2019-12-18 23:27:09,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:09,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640538508] [2019-12-18 23:27:09,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:09,667 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-12-18 23:27:10,139 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 23:27:10,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640538508] [2019-12-18 23:27:10,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:10,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:10,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726242310] [2019-12-18 23:27:10,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:10,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:10,141 INFO L87 Difference]: Start difference. First operand 4498 states and 14382 transitions. Second operand 16 states. [2019-12-18 23:27:11,225 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-18 23:27:11,465 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-18 23:27:11,602 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-18 23:27:11,900 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 23:27:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:14,188 INFO L93 Difference]: Finished difference Result 8113 states and 26317 transitions. [2019-12-18 23:27:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:27:14,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:14,202 INFO L225 Difference]: With dead ends: 8113 [2019-12-18 23:27:14,202 INFO L226 Difference]: Without dead ends: 8113 [2019-12-18 23:27:14,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:27:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8113 states. [2019-12-18 23:27:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8113 to 5360. [2019-12-18 23:27:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5360 states. [2019-12-18 23:27:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 17288 transitions. [2019-12-18 23:27:14,286 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 17288 transitions. Word has length 27 [2019-12-18 23:27:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 5360 states and 17288 transitions. [2019-12-18 23:27:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 17288 transitions. [2019-12-18 23:27:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:14,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:14,290 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 23:27:14,291 INFO L410 AbstractCegarLoop]: === Iteration 56 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1627488199, now seen corresponding path program 7 times [2019-12-18 23:27:14,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:14,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29079091] [2019-12-18 23:27:14,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:14,815 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2019-12-18 23:27:15,106 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 23:27:15,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29079091] [2019-12-18 23:27:15,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:15,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:15,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795791003] [2019-12-18 23:27:15,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:15,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:15,107 INFO L87 Difference]: Start difference. First operand 5360 states and 17288 transitions. Second operand 16 states. [2019-12-18 23:27:15,735 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-12-18 23:27:16,077 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-12-18 23:27:16,613 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-18 23:27:16,741 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-12-18 23:27:17,057 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 23:27:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:19,598 INFO L93 Difference]: Finished difference Result 8020 states and 25970 transitions. [2019-12-18 23:27:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:27:19,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:19,611 INFO L225 Difference]: With dead ends: 8020 [2019-12-18 23:27:19,611 INFO L226 Difference]: Without dead ends: 8020 [2019-12-18 23:27:19,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:27:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8020 states. [2019-12-18 23:27:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8020 to 4550. [2019-12-18 23:27:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-12-18 23:27:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 14549 transitions. [2019-12-18 23:27:19,689 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 14549 transitions. Word has length 27 [2019-12-18 23:27:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:19,690 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 14549 transitions. [2019-12-18 23:27:19,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 14549 transitions. [2019-12-18 23:27:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:19,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:19,693 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 23:27:19,693 INFO L410 AbstractCegarLoop]: === Iteration 57 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1724332627, now seen corresponding path program 5 times [2019-12-18 23:27:19,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:19,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753160616] [2019-12-18 23:27:19,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:20,328 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2019-12-18 23:27:20,554 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 23:27:20,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753160616] [2019-12-18 23:27:20,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:20,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:20,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026574717] [2019-12-18 23:27:20,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:20,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:20,555 INFO L87 Difference]: Start difference. First operand 4550 states and 14549 transitions. Second operand 16 states. [2019-12-18 23:27:21,697 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-18 23:27:21,942 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-12-18 23:27:22,122 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-18 23:27:22,345 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-18 23:27:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:23,471 INFO L93 Difference]: Finished difference Result 6084 states and 19651 transitions. [2019-12-18 23:27:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:27:23,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:23,479 INFO L225 Difference]: With dead ends: 6084 [2019-12-18 23:27:23,480 INFO L226 Difference]: Without dead ends: 6084 [2019-12-18 23:27:23,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:27:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2019-12-18 23:27:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 4544. [2019-12-18 23:27:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-12-18 23:27:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14531 transitions. [2019-12-18 23:27:23,546 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14531 transitions. Word has length 27 [2019-12-18 23:27:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:23,546 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 14531 transitions. [2019-12-18 23:27:23,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14531 transitions. [2019-12-18 23:27:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:23,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:23,550 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 23:27:23,550 INFO L410 AbstractCegarLoop]: === Iteration 58 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 35720313, now seen corresponding path program 6 times [2019-12-18 23:27:23,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:23,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801452361] [2019-12-18 23:27:23,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:24,433 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2019-12-18 23:27:24,693 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 23:27:24,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801452361] [2019-12-18 23:27:24,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:24,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:24,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738163006] [2019-12-18 23:27:24,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:24,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:24,695 INFO L87 Difference]: Start difference. First operand 4544 states and 14531 transitions. Second operand 16 states. [2019-12-18 23:27:25,958 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-12-18 23:27:26,146 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-12-18 23:27:26,324 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 23:27:26,527 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-18 23:27:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:27,679 INFO L93 Difference]: Finished difference Result 7063 states and 22810 transitions. [2019-12-18 23:27:27,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:27:27,679 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:27,690 INFO L225 Difference]: With dead ends: 7063 [2019-12-18 23:27:27,691 INFO L226 Difference]: Without dead ends: 7063 [2019-12-18 23:27:27,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:27:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-12-18 23:27:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 5176. [2019-12-18 23:27:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5176 states. [2019-12-18 23:27:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 16652 transitions. [2019-12-18 23:27:27,775 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 16652 transitions. Word has length 27 [2019-12-18 23:27:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:27,776 INFO L462 AbstractCegarLoop]: Abstraction has 5176 states and 16652 transitions. [2019-12-18 23:27:27,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 16652 transitions. [2019-12-18 23:27:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:27,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:27,780 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 23:27:27,781 INFO L410 AbstractCegarLoop]: === Iteration 59 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 35720317, now seen corresponding path program 2 times [2019-12-18 23:27:27,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:27,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808952692] [2019-12-18 23:27:27,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:28,370 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2019-12-18 23:27:28,720 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 34 [2019-12-18 23:27:28,890 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-12-18 23:27:29,165 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 23:27:29,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808952692] [2019-12-18 23:27:29,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:29,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 23:27:29,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020030137] [2019-12-18 23:27:29,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:27:29,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:29,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:27:29,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:27:29,166 INFO L87 Difference]: Start difference. First operand 5176 states and 16652 transitions. Second operand 17 states. [2019-12-18 23:27:30,429 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-12-18 23:27:30,588 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-18 23:27:30,787 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-12-18 23:27:30,967 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 23:27:31,179 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 23:27:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:32,411 INFO L93 Difference]: Finished difference Result 6970 states and 22463 transitions. [2019-12-18 23:27:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:27:32,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 23:27:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:32,422 INFO L225 Difference]: With dead ends: 6970 [2019-12-18 23:27:32,422 INFO L226 Difference]: Without dead ends: 6970 [2019-12-18 23:27:32,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-18 23:27:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2019-12-18 23:27:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 4706. [2019-12-18 23:27:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4706 states. [2019-12-18 23:27:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4706 states to 4706 states and 15017 transitions. [2019-12-18 23:27:32,494 INFO L78 Accepts]: Start accepts. Automaton has 4706 states and 15017 transitions. Word has length 27 [2019-12-18 23:27:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:32,494 INFO L462 AbstractCegarLoop]: Abstraction has 4706 states and 15017 transitions. [2019-12-18 23:27:32,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:27:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4706 states and 15017 transitions. [2019-12-18 23:27:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:32,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:32,498 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 23:27:32,498 INFO L410 AbstractCegarLoop]: === Iteration 60 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1591840427, now seen corresponding path program 7 times [2019-12-18 23:27:32,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:32,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329577055] [2019-12-18 23:27:32,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:33,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 23:27:33,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329577055] [2019-12-18 23:27:33,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:33,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:27:33,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830699076] [2019-12-18 23:27:33,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:27:33,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:27:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:27:33,226 INFO L87 Difference]: Start difference. First operand 4706 states and 15017 transitions. Second operand 15 states. [2019-12-18 23:27:34,653 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-18 23:27:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:36,054 INFO L93 Difference]: Finished difference Result 6907 states and 22363 transitions. [2019-12-18 23:27:36,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:27:36,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:27:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:36,064 INFO L225 Difference]: With dead ends: 6907 [2019-12-18 23:27:36,065 INFO L226 Difference]: Without dead ends: 6907 [2019-12-18 23:27:36,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:27:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2019-12-18 23:27:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 5716. [2019-12-18 23:27:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2019-12-18 23:27:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 18376 transitions. [2019-12-18 23:27:36,142 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 18376 transitions. Word has length 27 [2019-12-18 23:27:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:36,142 INFO L462 AbstractCegarLoop]: Abstraction has 5716 states and 18376 transitions. [2019-12-18 23:27:36,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:27:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 18376 transitions. [2019-12-18 23:27:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:36,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:36,147 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 23:27:36,147 INFO L410 AbstractCegarLoop]: === Iteration 61 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1591840431, now seen corresponding path program 3 times [2019-12-18 23:27:36,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:36,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291418699] [2019-12-18 23:27:36,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:36,659 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 35 [2019-12-18 23:27:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:36,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291418699] [2019-12-18 23:27:36,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:36,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:27:36,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546073444] [2019-12-18 23:27:36,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:27:36,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:27:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:27:36,884 INFO L87 Difference]: Start difference. First operand 5716 states and 18376 transitions. Second operand 15 states. [2019-12-18 23:27:38,148 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-12-18 23:27:38,461 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 23:27:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:40,124 INFO L93 Difference]: Finished difference Result 7336 states and 23665 transitions. [2019-12-18 23:27:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:27:40,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:27:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:40,136 INFO L225 Difference]: With dead ends: 7336 [2019-12-18 23:27:40,136 INFO L226 Difference]: Without dead ends: 7336 [2019-12-18 23:27:40,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:27:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7336 states. [2019-12-18 23:27:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7336 to 4490. [2019-12-18 23:27:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4490 states. [2019-12-18 23:27:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 14369 transitions. [2019-12-18 23:27:40,213 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 14369 transitions. Word has length 27 [2019-12-18 23:27:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:40,213 INFO L462 AbstractCegarLoop]: Abstraction has 4490 states and 14369 transitions. [2019-12-18 23:27:40,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:27:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 14369 transitions. [2019-12-18 23:27:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:40,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:40,216 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 23:27:40,216 INFO L410 AbstractCegarLoop]: === Iteration 62 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 437320403, now seen corresponding path program 8 times [2019-12-18 23:27:40,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:40,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970802976] [2019-12-18 23:27:40,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:40,897 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 35 [2019-12-18 23:27:41,229 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 23:27:41,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970802976] [2019-12-18 23:27:41,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:41,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:41,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044616011] [2019-12-18 23:27:41,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:41,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:41,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:41,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:41,230 INFO L87 Difference]: Start difference. First operand 4490 states and 14369 transitions. Second operand 16 states. [2019-12-18 23:27:42,950 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-18 23:27:43,170 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-12-18 23:27:43,378 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-18 23:27:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:44,655 INFO L93 Difference]: Finished difference Result 5577 states and 18115 transitions. [2019-12-18 23:27:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:27:44,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:27:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:44,664 INFO L225 Difference]: With dead ends: 5577 [2019-12-18 23:27:44,664 INFO L226 Difference]: Without dead ends: 5577 [2019-12-18 23:27:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:27:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2019-12-18 23:27:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 4942. [2019-12-18 23:27:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4942 states. [2019-12-18 23:27:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 15950 transitions. [2019-12-18 23:27:44,728 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 15950 transitions. Word has length 27 [2019-12-18 23:27:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:44,729 INFO L462 AbstractCegarLoop]: Abstraction has 4942 states and 15950 transitions. [2019-12-18 23:27:44,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:27:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 15950 transitions. [2019-12-18 23:27:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:27:44,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:44,733 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 23:27:44,733 INFO L410 AbstractCegarLoop]: === Iteration 63 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 437320407, now seen corresponding path program 4 times [2019-12-18 23:27:44,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:44,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310892698] [2019-12-18 23:27:44,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:45,391 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2019-12-18 23:27:45,630 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 23:27:45,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310892698] [2019-12-18 23:27:45,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:45,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:27:45,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270487712] [2019-12-18 23:27:45,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:27:45,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:27:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:27:45,632 INFO L87 Difference]: Start difference. First operand 4942 states and 15950 transitions. Second operand 16 states. [2019-12-18 23:27:47,125 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-18 23:27:47,292 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-18 23:27:47,484 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 Received shutdown request... [2019-12-18 23:27:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:27:47,932 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:27:47,963 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:27:47,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:27:47 BasicIcfg [2019-12-18 23:27:47,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:27:47,966 INFO L168 Benchmark]: Toolchain (without parser) took 243038.64 ms. Allocated memory was 136.8 MB in the beginning and 876.1 MB in the end (delta: 739.2 MB). Free memory was 99.3 MB in the beginning and 795.2 MB in the end (delta: -696.0 MB). Peak memory consumption was 702.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,966 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 938.21 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 121.4 MB in the end (delta: -22.4 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 200.8 MB. Free memory was 121.4 MB in the beginning and 118.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,967 INFO L168 Benchmark]: Boogie Preprocessor took 65.88 ms. Allocated memory is still 200.8 MB. Free memory was 118.6 MB in the beginning and 115.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,968 INFO L168 Benchmark]: RCFGBuilder took 1145.53 ms. Allocated memory was 200.8 MB in the beginning and 231.2 MB in the end (delta: 30.4 MB). Free memory was 115.8 MB in the beginning and 191.6 MB in the end (delta: -75.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,968 INFO L168 Benchmark]: TraceAbstraction took 240808.38 ms. Allocated memory was 231.2 MB in the beginning and 876.1 MB in the end (delta: 644.9 MB). Free memory was 190.2 MB in the beginning and 795.2 MB in the end (delta: -605.1 MB). Peak memory consumption was 699.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:47,970 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 938.21 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 121.4 MB in the end (delta: -22.4 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 200.8 MB. Free memory was 121.4 MB in the beginning and 118.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.88 ms. Allocated memory is still 200.8 MB. Free memory was 118.6 MB in the beginning and 115.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1145.53 ms. Allocated memory was 200.8 MB in the beginning and 231.2 MB in the end (delta: 30.4 MB). Free memory was 115.8 MB in the beginning and 191.6 MB in the end (delta: -75.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240808.38 ms. Allocated memory was 231.2 MB in the beginning and 876.1 MB in the end (delta: 644.9 MB). Free memory was 190.2 MB in the beginning and 795.2 MB in the end (delta: -605.1 MB). Peak memory consumption was 699.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 189 ProgramPointsBefore, 59 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 7 ChoiceCompositions, 8495 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 27552 CheckedPairsTotal, 160 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 (4942states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (2748 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (4942states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (2748 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (4942states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (2748 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (4942states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (2748 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Result: TIMEOUT, OverallTime: 240.6s, OverallIterations: 63, TraceHistogramMax: 1, AutomataDifference: 186.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4052 SDtfs, 15279 SDslu, 18643 SDs, 0 SdLazy, 91836 SolverSat, 1383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1565 GetRequests, 42 SyntacticMatches, 32 SemanticMatches, 1491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4682 ImplicationChecksByTransitivity, 103.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6138occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 62 MinimizatonAttempts, 72558 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 42.2s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1615 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 63 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