/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:07:03,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:07:03,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:07:03,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:07:03,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:07:03,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:07:03,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:07:03,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:07:03,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:07:03,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:07:03,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:07:03,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:07:03,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:07:03,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:07:03,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:07:03,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:07:03,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:07:03,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:07:03,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:07:03,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:07:03,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:07:03,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:07:03,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:07:03,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:07:03,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:07:03,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:07:03,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:07:03,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:07:03,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:07:03,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:07:03,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:07:03,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:07:03,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:07:03,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:07:03,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:07:03,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:07:03,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:07:03,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:07:03,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:07:03,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:07:03,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:07:03,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:07:03,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:07:03,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:07:03,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:07:03,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:07:03,571 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:07:03,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:07:03,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:07:03,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:07:03,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:07:03,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:07:03,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:07:03,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:07:03,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:07:03,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:07:03,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:07:03,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:07:03,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:07:03,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:07:03,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:07:03,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:07:03,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:07:03,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:07:03,576 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:07:03,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:07:03,576 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:07:03,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:07:03,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:07:03,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:07:03,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:07:03,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:07:03,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:07:03,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2019-12-27 18:07:03,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca595d15/b116718389524ab380bcf97335dd19a2/FLAG7a7775b7c [2019-12-27 18:07:04,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:07:04,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2019-12-27 18:07:04,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca595d15/b116718389524ab380bcf97335dd19a2/FLAG7a7775b7c [2019-12-27 18:07:04,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca595d15/b116718389524ab380bcf97335dd19a2 [2019-12-27 18:07:04,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:07:04,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:07:04,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:07:04,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:07:04,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:07:04,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:04,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04, skipping insertion in model container [2019-12-27 18:07:04,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:04,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:07:04,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:07:05,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:07:05,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:07:05,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:07:05,567 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:07:05,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05 WrapperNode [2019-12-27 18:07:05,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:07:05,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:07:05,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:07:05,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:07:05,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:07:05,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:07:05,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:07:05,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:07:05,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... [2019-12-27 18:07:05,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:07:05,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:07:05,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:07:05,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:07:05,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:07:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:07:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:07:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:07:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:07:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:07:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:07:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:07:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:07:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:07:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:07:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:07:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:07:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:07:05,763 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:07:06,468 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:07:06,468 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:07:06,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:07:06 BoogieIcfgContainer [2019-12-27 18:07:06,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:07:06,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:07:06,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:07:06,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:07:06,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:07:04" (1/3) ... [2019-12-27 18:07:06,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e7d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:07:06, skipping insertion in model container [2019-12-27 18:07:06,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:05" (2/3) ... [2019-12-27 18:07:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e7d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:07:06, skipping insertion in model container [2019-12-27 18:07:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:07:06" (3/3) ... [2019-12-27 18:07:06,482 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_rmo.opt.i [2019-12-27 18:07:06,493 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:07:06,493 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:07:06,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:07:06,505 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:07:06,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,611 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,618 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,642 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:07:06,664 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:07:06,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:07:06,664 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:07:06,664 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:07:06,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:07:06,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:07:06,665 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:07:06,665 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:07:06,681 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:07:06,683 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:07:06,780 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:07:06,780 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:07:06,796 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:07:06,822 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:07:06,873 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:07:06,873 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:07:06,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:07:06,900 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:07:06,901 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:07:12,375 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:07:12,501 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:07:12,608 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-27 18:07:12,609 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:07:12,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:07:23,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:07:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:07:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:07:24,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:24,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:07:24,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-27 18:07:24,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:24,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124385215] [2019-12-27 18:07:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:24,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124385215] [2019-12-27 18:07:24,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:24,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:07:24,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660250739] [2019-12-27 18:07:24,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:24,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:24,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:07:24,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:24,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:24,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:07:24,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:07:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:07:24,287 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:07:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:26,952 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:07:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:07:26,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:07:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:27,539 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:07:27,539 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:07:27,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:07:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:07:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:07:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:07:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:07:34,937 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:07:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:34,937 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:07:34,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:07:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:07:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:07:34,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:34,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:34,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-27 18:07:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:34,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158562856] [2019-12-27 18:07:34,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:35,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158562856] [2019-12-27 18:07:35,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:35,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:35,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365201070] [2019-12-27 18:07:35,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:35,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:35,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:07:35,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:35,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:35,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:07:35,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:07:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:07:35,114 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:07:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:38,859 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:07:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:38,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:07:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:39,344 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:07:39,344 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:07:39,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:07:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:07:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:07:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:07:51,849 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:07:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:51,850 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:07:51,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:07:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:07:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:07:51,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:51,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:51,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:51,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-27 18:07:51,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:51,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413730431] [2019-12-27 18:07:51,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:51,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413730431] [2019-12-27 18:07:51,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:51,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:07:51,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [892397442] [2019-12-27 18:07:51,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:51,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:51,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:07:51,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:51,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:51,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:07:51,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:07:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:07:51,970 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:07:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:52,198 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-27 18:07:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:07:52,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:07:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:52,290 INFO L225 Difference]: With dead ends: 36525 [2019-12-27 18:07:52,291 INFO L226 Difference]: Without dead ends: 28771 [2019-12-27 18:07:52,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-27 18:07:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-27 18:07:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-27 18:07:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-27 18:07:52,841 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-27 18:07:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-27 18:07:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:07:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-27 18:07:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:52,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:52,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:52,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-27 18:07:52,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:52,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114896871] [2019-12-27 18:07:52,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:52,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-27 18:07:52,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114896871] [2019-12-27 18:07:52,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:52,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:07:52,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782958181] [2019-12-27 18:07:52,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:52,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:52,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:52,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:52,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:07:52,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:52,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:52,960 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 5 states. [2019-12-27 18:07:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:54,952 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-27 18:07:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:07:54,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:55,055 INFO L225 Difference]: With dead ends: 42081 [2019-12-27 18:07:55,056 INFO L226 Difference]: Without dead ends: 42081 [2019-12-27 18:07:55,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-27 18:07:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-27 18:07:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-27 18:07:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-27 18:07:55,670 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-27 18:07:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:55,670 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-27 18:07:55,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-27 18:07:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:55,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:55,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:55,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-27 18:07:55,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:55,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315572738] [2019-12-27 18:07:55,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:55,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315572738] [2019-12-27 18:07:55,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:55,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:55,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208081756] [2019-12-27 18:07:55,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:55,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:55,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:55,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:55,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:55,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:55,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:55,819 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 5 states. [2019-12-27 18:07:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:56,266 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-27 18:07:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:56,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:56,349 INFO L225 Difference]: With dead ends: 39611 [2019-12-27 18:07:56,349 INFO L226 Difference]: Without dead ends: 39522 [2019-12-27 18:07:56,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-27 18:07:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-27 18:07:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-27 18:07:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-27 18:07:57,233 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-27 18:07:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-27 18:07:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-27 18:07:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:57,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:57,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:57,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-27 18:07:57,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:57,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425219349] [2019-12-27 18:07:57,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:57,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425219349] [2019-12-27 18:07:57,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:57,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:57,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982888780] [2019-12-27 18:07:57,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:57,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:57,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:57,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:57,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:57,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:57,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:57,357 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 5 states. [2019-12-27 18:07:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:57,750 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-27 18:07:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:57,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:57,822 INFO L225 Difference]: With dead ends: 42436 [2019-12-27 18:07:57,823 INFO L226 Difference]: Without dead ends: 42329 [2019-12-27 18:07:57,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-27 18:07:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-27 18:07:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-27 18:07:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-27 18:07:58,768 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-27 18:07:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:58,769 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-27 18:07:58,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-27 18:07:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:07:58,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:58,782 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] [2019-12-27 18:07:58,782 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-27 18:07:58,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:58,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041453739] [2019-12-27 18:07:58,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:58,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041453739] [2019-12-27 18:07:58,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:58,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:07:58,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061536448] [2019-12-27 18:07:58,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:58,926 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:58,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 18:07:58,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:58,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:58,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:58,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:58,941 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-27 18:07:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:59,580 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-27 18:07:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:07:59,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 18:07:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:59,661 INFO L225 Difference]: With dead ends: 48205 [2019-12-27 18:07:59,661 INFO L226 Difference]: Without dead ends: 48029 [2019-12-27 18:07:59,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:07:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-27 18:08:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-27 18:08:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-27 18:08:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-27 18:08:00,807 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-27 18:08:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:00,807 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-27 18:08:00,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-27 18:08:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:08:00,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:00,817 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] [2019-12-27 18:08:00,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-27 18:08:00,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:00,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521474337] [2019-12-27 18:08:00,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:00,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521474337] [2019-12-27 18:08:00,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:00,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:00,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125332506] [2019-12-27 18:08:00,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:00,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:00,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:08:00,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:00,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:00,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:00,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:00,990 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 6 states. [2019-12-27 18:08:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:02,132 INFO L93 Difference]: Finished difference Result 73484 states and 242968 transitions. [2019-12-27 18:08:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:08:02,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:08:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:02,278 INFO L225 Difference]: With dead ends: 73484 [2019-12-27 18:08:02,278 INFO L226 Difference]: Without dead ends: 73202 [2019-12-27 18:08:02,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73202 states. [2019-12-27 18:08:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73202 to 35597. [2019-12-27 18:08:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35597 states. [2019-12-27 18:08:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35597 states to 35597 states and 118237 transitions. [2019-12-27 18:08:03,767 INFO L78 Accepts]: Start accepts. Automaton has 35597 states and 118237 transitions. Word has length 22 [2019-12-27 18:08:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:03,768 INFO L462 AbstractCegarLoop]: Abstraction has 35597 states and 118237 transitions. [2019-12-27 18:08:03,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 35597 states and 118237 transitions. [2019-12-27 18:08:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:08:03,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:03,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] [2019-12-27 18:08:03,780 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-27 18:08:03,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:03,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71445482] [2019-12-27 18:08:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:03,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-27 18:08:03,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71445482] [2019-12-27 18:08:03,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:03,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:08:03,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762441854] [2019-12-27 18:08:03,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:03,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:03,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:08:03,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:03,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:03,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:03,977 INFO L87 Difference]: Start difference. First operand 35597 states and 118237 transitions. Second operand 7 states. [2019-12-27 18:08:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:04,673 INFO L93 Difference]: Finished difference Result 49542 states and 161149 transitions. [2019-12-27 18:08:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:08:04,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 18:08:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:04,766 INFO L225 Difference]: With dead ends: 49542 [2019-12-27 18:08:04,766 INFO L226 Difference]: Without dead ends: 49514 [2019-12-27 18:08:04,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49514 states. [2019-12-27 18:08:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49514 to 40556. [2019-12-27 18:08:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40556 states. [2019-12-27 18:08:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40556 states to 40556 states and 133684 transitions. [2019-12-27 18:08:05,576 INFO L78 Accepts]: Start accepts. Automaton has 40556 states and 133684 transitions. Word has length 25 [2019-12-27 18:08:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:05,577 INFO L462 AbstractCegarLoop]: Abstraction has 40556 states and 133684 transitions. [2019-12-27 18:08:05,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40556 states and 133684 transitions. [2019-12-27 18:08:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:08:05,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:05,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:05,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-27 18:08:05,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:05,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134775710] [2019-12-27 18:08:05,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:05,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134775710] [2019-12-27 18:08:05,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:05,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:05,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732482502] [2019-12-27 18:08:05,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:05,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:05,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:08:05,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:05,969 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 18:08:05,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:05,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:05,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:05,997 INFO L87 Difference]: Start difference. First operand 40556 states and 133684 transitions. Second operand 7 states. [2019-12-27 18:08:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:06,145 INFO L93 Difference]: Finished difference Result 18642 states and 57265 transitions. [2019-12-27 18:08:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:06,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:08:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:06,172 INFO L225 Difference]: With dead ends: 18642 [2019-12-27 18:08:06,173 INFO L226 Difference]: Without dead ends: 15915 [2019-12-27 18:08:06,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2019-12-27 18:08:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 15305. [2019-12-27 18:08:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15305 states. [2019-12-27 18:08:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15305 states to 15305 states and 46743 transitions. [2019-12-27 18:08:06,425 INFO L78 Accepts]: Start accepts. Automaton has 15305 states and 46743 transitions. Word has length 28 [2019-12-27 18:08:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:06,426 INFO L462 AbstractCegarLoop]: Abstraction has 15305 states and 46743 transitions. [2019-12-27 18:08:06,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15305 states and 46743 transitions. [2019-12-27 18:08:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:08:06,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:06,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:06,451 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -672186652, now seen corresponding path program 1 times [2019-12-27 18:08:06,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:06,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191379302] [2019-12-27 18:08:06,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191379302] [2019-12-27 18:08:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020845453] [2019-12-27 18:08:06,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:06,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:06,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 63 transitions. [2019-12-27 18:08:06,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:06,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:08:06,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:06,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:06,556 INFO L87 Difference]: Start difference. First operand 15305 states and 46743 transitions. Second operand 5 states. [2019-12-27 18:08:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:06,809 INFO L93 Difference]: Finished difference Result 34423 states and 105996 transitions. [2019-12-27 18:08:06,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:06,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 18:08:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:06,841 INFO L225 Difference]: With dead ends: 34423 [2019-12-27 18:08:06,841 INFO L226 Difference]: Without dead ends: 21545 [2019-12-27 18:08:06,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21545 states. [2019-12-27 18:08:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21545 to 15504. [2019-12-27 18:08:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15504 states. [2019-12-27 18:08:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15504 states to 15504 states and 47044 transitions. [2019-12-27 18:08:07,103 INFO L78 Accepts]: Start accepts. Automaton has 15504 states and 47044 transitions. Word has length 39 [2019-12-27 18:08:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:07,103 INFO L462 AbstractCegarLoop]: Abstraction has 15504 states and 47044 transitions. [2019-12-27 18:08:07,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15504 states and 47044 transitions. [2019-12-27 18:08:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:08:07,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:07,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:07,124 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1438865066, now seen corresponding path program 2 times [2019-12-27 18:08:07,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:07,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061849900] [2019-12-27 18:08:07,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:07,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061849900] [2019-12-27 18:08:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:07,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:07,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122360655] [2019-12-27 18:08:07,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:07,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:07,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 96 transitions. [2019-12-27 18:08:07,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:07,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:07,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:08:07,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:08:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:07,245 INFO L87 Difference]: Start difference. First operand 15504 states and 47044 transitions. Second operand 4 states. [2019-12-27 18:08:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:07,376 INFO L93 Difference]: Finished difference Result 24694 states and 75669 transitions. [2019-12-27 18:08:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:07,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 18:08:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:07,404 INFO L225 Difference]: With dead ends: 24694 [2019-12-27 18:08:07,404 INFO L226 Difference]: Without dead ends: 11664 [2019-12-27 18:08:07,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11664 states. [2019-12-27 18:08:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11664 to 11539. [2019-12-27 18:08:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11539 states. [2019-12-27 18:08:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11539 states to 11539 states and 34255 transitions. [2019-12-27 18:08:07,596 INFO L78 Accepts]: Start accepts. Automaton has 11539 states and 34255 transitions. Word has length 39 [2019-12-27 18:08:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:07,597 INFO L462 AbstractCegarLoop]: Abstraction has 11539 states and 34255 transitions. [2019-12-27 18:08:07,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:08:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11539 states and 34255 transitions. [2019-12-27 18:08:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:07,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:07,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:07,613 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-27 18:08:07,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:07,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399766064] [2019-12-27 18:08:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:07,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399766064] [2019-12-27 18:08:07,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:07,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:08:07,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775470306] [2019-12-27 18:08:07,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:07,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:07,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 18:08:07,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:07,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:08:07,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:08:07,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:07,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:08:07,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:08:07,870 INFO L87 Difference]: Start difference. First operand 11539 states and 34255 transitions. Second operand 8 states. [2019-12-27 18:08:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:08,222 INFO L93 Difference]: Finished difference Result 10497 states and 31521 transitions. [2019-12-27 18:08:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:08:08,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 18:08:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:08,241 INFO L225 Difference]: With dead ends: 10497 [2019-12-27 18:08:08,241 INFO L226 Difference]: Without dead ends: 8327 [2019-12-27 18:08:08,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:08:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-12-27 18:08:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7781. [2019-12-27 18:08:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7781 states. [2019-12-27 18:08:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7781 states to 7781 states and 24933 transitions. [2019-12-27 18:08:08,536 INFO L78 Accepts]: Start accepts. Automaton has 7781 states and 24933 transitions. Word has length 40 [2019-12-27 18:08:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:08,537 INFO L462 AbstractCegarLoop]: Abstraction has 7781 states and 24933 transitions. [2019-12-27 18:08:08,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:08:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 24933 transitions. [2019-12-27 18:08:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:08,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:08,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:08,546 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1638387748, now seen corresponding path program 1 times [2019-12-27 18:08:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255784865] [2019-12-27 18:08:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:08,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255784865] [2019-12-27 18:08:08,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:08,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953070278] [2019-12-27 18:08:08,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:08,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:08,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:08:08,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:08,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:08,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:08,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:08,878 INFO L87 Difference]: Start difference. First operand 7781 states and 24933 transitions. Second operand 10 states. [2019-12-27 18:08:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:11,601 INFO L93 Difference]: Finished difference Result 29249 states and 91425 transitions. [2019-12-27 18:08:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:08:11,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:11,643 INFO L225 Difference]: With dead ends: 29249 [2019-12-27 18:08:11,643 INFO L226 Difference]: Without dead ends: 22374 [2019-12-27 18:08:11,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 18:08:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22374 states. [2019-12-27 18:08:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22374 to 9364. [2019-12-27 18:08:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9364 states. [2019-12-27 18:08:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 29942 transitions. [2019-12-27 18:08:11,883 INFO L78 Accepts]: Start accepts. Automaton has 9364 states and 29942 transitions. Word has length 54 [2019-12-27 18:08:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 9364 states and 29942 transitions. [2019-12-27 18:08:11,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9364 states and 29942 transitions. [2019-12-27 18:08:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:11,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:11,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:11,895 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash 341327716, now seen corresponding path program 2 times [2019-12-27 18:08:11,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:11,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169371986] [2019-12-27 18:08:11,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:11,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169371986] [2019-12-27 18:08:11,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:11,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:11,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553915647] [2019-12-27 18:08:11,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:11,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:12,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:08:12,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:12,319 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:12,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:12,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:12,321 INFO L87 Difference]: Start difference. First operand 9364 states and 29942 transitions. Second operand 10 states. [2019-12-27 18:08:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:13,639 INFO L93 Difference]: Finished difference Result 19928 states and 62749 transitions. [2019-12-27 18:08:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:08:13,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:13,671 INFO L225 Difference]: With dead ends: 19928 [2019-12-27 18:08:13,671 INFO L226 Difference]: Without dead ends: 15078 [2019-12-27 18:08:13,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:08:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2019-12-27 18:08:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 11581. [2019-12-27 18:08:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11581 states. [2019-12-27 18:08:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11581 states to 11581 states and 36769 transitions. [2019-12-27 18:08:13,942 INFO L78 Accepts]: Start accepts. Automaton has 11581 states and 36769 transitions. Word has length 54 [2019-12-27 18:08:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:13,943 INFO L462 AbstractCegarLoop]: Abstraction has 11581 states and 36769 transitions. [2019-12-27 18:08:13,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11581 states and 36769 transitions. [2019-12-27 18:08:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:13,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:13,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:13,956 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1312613832, now seen corresponding path program 3 times [2019-12-27 18:08:13,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:13,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366917566] [2019-12-27 18:08:13,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:14,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366917566] [2019-12-27 18:08:14,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:14,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:14,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284215313] [2019-12-27 18:08:14,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:14,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:14,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 307 transitions. [2019-12-27 18:08:14,175 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:14,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:14,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:14,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:14,207 INFO L87 Difference]: Start difference. First operand 11581 states and 36769 transitions. Second operand 10 states. [2019-12-27 18:08:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:16,103 INFO L93 Difference]: Finished difference Result 45992 states and 142236 transitions. [2019-12-27 18:08:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 18:08:16,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:16,197 INFO L225 Difference]: With dead ends: 45992 [2019-12-27 18:08:16,198 INFO L226 Difference]: Without dead ends: 37922 [2019-12-27 18:08:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1793, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 18:08:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37922 states. [2019-12-27 18:08:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37922 to 14280. [2019-12-27 18:08:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14280 states. [2019-12-27 18:08:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14280 states to 14280 states and 45364 transitions. [2019-12-27 18:08:17,254 INFO L78 Accepts]: Start accepts. Automaton has 14280 states and 45364 transitions. Word has length 54 [2019-12-27 18:08:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:17,255 INFO L462 AbstractCegarLoop]: Abstraction has 14280 states and 45364 transitions. [2019-12-27 18:08:17,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14280 states and 45364 transitions. [2019-12-27 18:08:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:17,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:17,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:17,282 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1898016224, now seen corresponding path program 4 times [2019-12-27 18:08:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:17,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773926987] [2019-12-27 18:08:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:17,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773926987] [2019-12-27 18:08:17,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:17,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:17,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666875209] [2019-12-27 18:08:17,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:17,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:17,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 437 transitions. [2019-12-27 18:08:17,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:17,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:08:17,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:08:17,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:08:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:17,617 INFO L87 Difference]: Start difference. First operand 14280 states and 45364 transitions. Second operand 4 states. [2019-12-27 18:08:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:17,868 INFO L93 Difference]: Finished difference Result 18001 states and 55602 transitions. [2019-12-27 18:08:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:17,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:08:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:17,895 INFO L225 Difference]: With dead ends: 18001 [2019-12-27 18:08:17,895 INFO L226 Difference]: Without dead ends: 18001 [2019-12-27 18:08:17,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18001 states. [2019-12-27 18:08:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18001 to 12340. [2019-12-27 18:08:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12340 states. [2019-12-27 18:08:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12340 states to 12340 states and 38607 transitions. [2019-12-27 18:08:18,109 INFO L78 Accepts]: Start accepts. Automaton has 12340 states and 38607 transitions. Word has length 54 [2019-12-27 18:08:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:18,109 INFO L462 AbstractCegarLoop]: Abstraction has 12340 states and 38607 transitions. [2019-12-27 18:08:18,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:08:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12340 states and 38607 transitions. [2019-12-27 18:08:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:08:18,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:18,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:18,128 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1879967444, now seen corresponding path program 1 times [2019-12-27 18:08:18,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:18,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293456131] [2019-12-27 18:08:18,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:18,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293456131] [2019-12-27 18:08:18,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:18,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:08:18,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102390873] [2019-12-27 18:08:18,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:18,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:18,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 18:08:18,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:18,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:08:18,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:08:18,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:08:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:08:18,527 INFO L87 Difference]: Start difference. First operand 12340 states and 38607 transitions. Second operand 11 states. [2019-12-27 18:08:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:19,690 INFO L93 Difference]: Finished difference Result 18988 states and 58514 transitions. [2019-12-27 18:08:19,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:08:19,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 18:08:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:19,712 INFO L225 Difference]: With dead ends: 18988 [2019-12-27 18:08:19,712 INFO L226 Difference]: Without dead ends: 14060 [2019-12-27 18:08:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:08:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14060 states. [2019-12-27 18:08:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14060 to 12736. [2019-12-27 18:08:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12736 states. [2019-12-27 18:08:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12736 states to 12736 states and 39531 transitions. [2019-12-27 18:08:19,914 INFO L78 Accepts]: Start accepts. Automaton has 12736 states and 39531 transitions. Word has length 55 [2019-12-27 18:08:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:19,915 INFO L462 AbstractCegarLoop]: Abstraction has 12736 states and 39531 transitions. [2019-12-27 18:08:19,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:08:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12736 states and 39531 transitions. [2019-12-27 18:08:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:08:19,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:19,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, 1, 1, 1, 1, 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-27 18:08:19,934 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1331122226, now seen corresponding path program 2 times [2019-12-27 18:08:19,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:19,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846657717] [2019-12-27 18:08:19,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:20,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846657717] [2019-12-27 18:08:20,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:20,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:08:20,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101747875] [2019-12-27 18:08:20,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:20,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:20,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 287 transitions. [2019-12-27 18:08:20,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:20,868 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-27 18:08:20,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:08:20,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:08:20,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:08:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:08:20,871 INFO L87 Difference]: Start difference. First operand 12736 states and 39531 transitions. Second operand 20 states. [2019-12-27 18:08:21,741 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-27 18:08:22,027 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-27 18:08:22,548 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-12-27 18:08:26,552 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-27 18:08:27,577 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 18:08:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:28,689 INFO L93 Difference]: Finished difference Result 55425 states and 168771 transitions. [2019-12-27 18:08:28,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 18:08:28,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-12-27 18:08:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:28,776 INFO L225 Difference]: With dead ends: 55425 [2019-12-27 18:08:28,776 INFO L226 Difference]: Without dead ends: 55305 [2019-12-27 18:08:28,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=852, Invalid=3704, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 18:08:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55305 states. [2019-12-27 18:08:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55305 to 20436. [2019-12-27 18:08:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20436 states. [2019-12-27 18:08:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20436 states to 20436 states and 63645 transitions. [2019-12-27 18:08:29,365 INFO L78 Accepts]: Start accepts. Automaton has 20436 states and 63645 transitions. Word has length 55 [2019-12-27 18:08:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:29,366 INFO L462 AbstractCegarLoop]: Abstraction has 20436 states and 63645 transitions. [2019-12-27 18:08:29,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:08:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20436 states and 63645 transitions. [2019-12-27 18:08:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:08:29,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:29,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:29,389 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1675553042, now seen corresponding path program 3 times [2019-12-27 18:08:29,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:29,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672503660] [2019-12-27 18:08:29,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:29,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672503660] [2019-12-27 18:08:29,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:29,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:29,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68252263] [2019-12-27 18:08:29,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:29,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:29,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 213 transitions. [2019-12-27 18:08:29,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:29,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:29,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:08:29,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:08:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:08:29,619 INFO L87 Difference]: Start difference. First operand 20436 states and 63645 transitions. Second operand 3 states. [2019-12-27 18:08:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:29,746 INFO L93 Difference]: Finished difference Result 20434 states and 63640 transitions. [2019-12-27 18:08:29,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:29,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:08:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:29,798 INFO L225 Difference]: With dead ends: 20434 [2019-12-27 18:08:29,799 INFO L226 Difference]: Without dead ends: 20434 [2019-12-27 18:08:29,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:08:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20434 states. [2019-12-27 18:08:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20434 to 15515. [2019-12-27 18:08:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15515 states. [2019-12-27 18:08:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15515 states to 15515 states and 48301 transitions. [2019-12-27 18:08:30,241 INFO L78 Accepts]: Start accepts. Automaton has 15515 states and 48301 transitions. Word has length 55 [2019-12-27 18:08:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:30,242 INFO L462 AbstractCegarLoop]: Abstraction has 15515 states and 48301 transitions. [2019-12-27 18:08:30,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:08:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15515 states and 48301 transitions. [2019-12-27 18:08:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:08:30,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:30,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:08:30,382 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 1 times [2019-12-27 18:08:30,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:30,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216660435] [2019-12-27 18:08:30,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:30,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216660435] [2019-12-27 18:08:30,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:30,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:08:30,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331822101] [2019-12-27 18:08:30,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:30,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:31,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 288 transitions. [2019-12-27 18:08:31,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:08:32,574 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-12-27 18:08:32,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 18:08:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 18:08:32,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 18:08:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:08:32,577 INFO L87 Difference]: Start difference. First operand 15515 states and 48301 transitions. Second operand 35 states. [2019-12-27 18:08:33,515 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 18:08:33,779 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-12-27 18:08:34,211 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 18:08:34,580 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 18:08:35,098 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-12-27 18:08:35,485 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2019-12-27 18:08:36,013 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 18:08:36,796 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2019-12-27 18:08:37,607 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-27 18:08:38,442 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-27 18:08:39,618 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-27 18:08:41,480 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:08:42,955 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:08:43,820 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 18:08:44,814 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-27 18:08:47,411 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 18:08:47,895 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-12-27 18:08:51,251 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-27 18:08:52,641 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-12-27 18:08:53,676 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-12-27 18:08:54,004 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 18:08:55,377 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:08:57,521 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-27 18:08:59,717 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:09:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:00,874 INFO L93 Difference]: Finished difference Result 48673 states and 144822 transitions. [2019-12-27 18:09:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-12-27 18:09:00,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2019-12-27 18:09:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:00,929 INFO L225 Difference]: With dead ends: 48673 [2019-12-27 18:09:00,929 INFO L226 Difference]: Without dead ends: 40703 [2019-12-27 18:09:00,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12422 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3902, Invalid=30508, Unknown=0, NotChecked=0, Total=34410 [2019-12-27 18:09:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40703 states. [2019-12-27 18:09:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40703 to 17262. [2019-12-27 18:09:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17262 states. [2019-12-27 18:09:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17262 states to 17262 states and 53354 transitions. [2019-12-27 18:09:01,334 INFO L78 Accepts]: Start accepts. Automaton has 17262 states and 53354 transitions. Word has length 56 [2019-12-27 18:09:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:01,334 INFO L462 AbstractCegarLoop]: Abstraction has 17262 states and 53354 transitions. [2019-12-27 18:09:01,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 18:09:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17262 states and 53354 transitions. [2019-12-27 18:09:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:09:01,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:01,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:09:01,353 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 501737926, now seen corresponding path program 2 times [2019-12-27 18:09:01,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:01,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626739924] [2019-12-27 18:09:01,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:02,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626739924] [2019-12-27 18:09:02,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:02,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 18:09:02,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429668296] [2019-12-27 18:09:02,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:02,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:02,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 335 transitions. [2019-12-27 18:09:02,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:02,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:09:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:09:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:09:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:09:05,198 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-12-27 18:09:05,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 58 times. [2019-12-27 18:09:05,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 18:09:05,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 18:09:05,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 18:09:05,201 INFO L87 Difference]: Start difference. First operand 17262 states and 53354 transitions. Second operand 43 states. [2019-12-27 18:09:06,165 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 18:09:06,442 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-12-27 18:09:06,911 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 18:09:07,329 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-12-27 18:09:07,925 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-12-27 18:09:08,167 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-27 18:09:08,496 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2019-12-27 18:09:09,074 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-12-27 18:09:09,724 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 18:09:10,056 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-12-27 18:09:10,423 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-12-27 18:09:10,725 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 18:09:11,368 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-27 18:09:11,946 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-12-27 18:09:12,449 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-27 18:09:12,644 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-27 18:09:13,451 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 18:09:14,984 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-27 18:09:15,843 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 18:09:17,032 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-12-27 18:09:18,709 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 18:09:19,475 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-27 18:09:20,062 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-27 18:09:21,743 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-27 18:09:21,968 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-27 18:09:22,368 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-12-27 18:09:24,463 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 18:09:24,849 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-12-27 18:09:25,117 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-12-27 18:09:25,378 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-12-27 18:09:27,246 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-12-27 18:09:27,992 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-27 18:09:29,565 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-27 18:09:30,229 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 18:09:35,519 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-27 18:09:36,178 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-27 18:09:39,112 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-12-27 18:09:39,291 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 18:09:39,680 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-12-27 18:09:40,023 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 18:09:40,292 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-27 18:09:40,671 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:09:41,346 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 18:09:41,583 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-27 18:09:42,725 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 18:09:43,537 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-27 18:09:43,770 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 18:09:45,508 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-27 18:09:45,791 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-27 18:09:46,050 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 18:09:46,365 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-12-27 18:09:48,280 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:09:49,488 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-12-27 18:09:49,744 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-27 18:09:52,145 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-27 18:09:53,967 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 18:09:54,368 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 18:09:54,995 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-27 18:09:55,696 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:09:56,303 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-27 18:09:56,612 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-27 18:09:57,021 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 18:09:57,575 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-12-27 18:09:57,749 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-12-27 18:09:58,138 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 18:09:59,662 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-27 18:10:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:02,844 INFO L93 Difference]: Finished difference Result 71553 states and 214559 transitions. [2019-12-27 18:10:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2019-12-27 18:10:02,844 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56 [2019-12-27 18:10:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:02,927 INFO L225 Difference]: With dead ends: 71553 [2019-12-27 18:10:02,927 INFO L226 Difference]: Without dead ends: 47503 [2019-12-27 18:10:02,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45954 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=10728, Invalid=103178, Unknown=0, NotChecked=0, Total=113906 [2019-12-27 18:10:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47503 states. [2019-12-27 18:10:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47503 to 19206. [2019-12-27 18:10:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19206 states. [2019-12-27 18:10:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19206 states to 19206 states and 60145 transitions. [2019-12-27 18:10:03,484 INFO L78 Accepts]: Start accepts. Automaton has 19206 states and 60145 transitions. Word has length 56 [2019-12-27 18:10:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:03,485 INFO L462 AbstractCegarLoop]: Abstraction has 19206 states and 60145 transitions. [2019-12-27 18:10:03,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 18:10:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19206 states and 60145 transitions. [2019-12-27 18:10:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:10:03,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:03,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:10:03,506 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:03,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2111125254, now seen corresponding path program 3 times [2019-12-27 18:10:03,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:03,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141036288] [2019-12-27 18:10:03,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:04,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141036288] [2019-12-27 18:10:04,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:04,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 18:10:04,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959669069] [2019-12-27 18:10:04,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:04,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:04,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 280 transitions. [2019-12-27 18:10:04,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:10:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:10:05,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:10:06,573 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-12-27 18:10:06,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 45 times. [2019-12-27 18:10:06,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 18:10:06,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 18:10:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:10:06,575 INFO L87 Difference]: Start difference. First operand 19206 states and 60145 transitions. Second operand 40 states. [2019-12-27 18:10:07,369 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 18:10:07,737 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-12-27 18:10:08,231 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 18:10:08,762 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 18:10:09,059 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-12-27 18:10:09,647 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-12-27 18:10:10,056 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2019-12-27 18:10:10,783 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 18:10:11,307 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-27 18:10:11,573 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2019-12-27 18:10:12,605 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-27 18:10:12,760 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-27 18:10:13,487 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-27 18:10:15,030 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-27 18:10:17,459 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:10:18,735 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:10:19,576 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 18:10:19,733 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:10:20,800 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-27 18:10:23,485 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 18:10:29,754 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:10:34,553 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 18:10:34,706 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:10:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:39,969 INFO L93 Difference]: Finished difference Result 48885 states and 146761 transitions. [2019-12-27 18:10:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2019-12-27 18:10:39,969 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 56 [2019-12-27 18:10:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:40,023 INFO L225 Difference]: With dead ends: 48885 [2019-12-27 18:10:40,023 INFO L226 Difference]: Without dead ends: 40240 [2019-12-27 18:10:40,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15946 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=3568, Invalid=41164, Unknown=0, NotChecked=0, Total=44732 [2019-12-27 18:10:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40240 states. [2019-12-27 18:10:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40240 to 19606. [2019-12-27 18:10:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19606 states. [2019-12-27 18:10:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19606 states to 19606 states and 60795 transitions. [2019-12-27 18:10:40,438 INFO L78 Accepts]: Start accepts. Automaton has 19606 states and 60795 transitions. Word has length 56 [2019-12-27 18:10:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:40,438 INFO L462 AbstractCegarLoop]: Abstraction has 19606 states and 60795 transitions. [2019-12-27 18:10:40,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 18:10:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19606 states and 60795 transitions. [2019-12-27 18:10:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:10:40,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:40,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:10:40,459 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1548506530, now seen corresponding path program 1 times [2019-12-27 18:10:40,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:40,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456523552] [2019-12-27 18:10:40,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:40,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456523552] [2019-12-27 18:10:40,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:40,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:10:40,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553224309] [2019-12-27 18:10:40,499 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:40,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:40,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 250 transitions. [2019-12-27 18:10:40,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:40,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:10:40,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:10:40,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:10:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:40,643 INFO L87 Difference]: Start difference. First operand 19606 states and 60795 transitions. Second operand 3 states. [2019-12-27 18:10:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:40,742 INFO L93 Difference]: Finished difference Result 20542 states and 62076 transitions. [2019-12-27 18:10:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:10:40,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 18:10:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:40,774 INFO L225 Difference]: With dead ends: 20542 [2019-12-27 18:10:40,774 INFO L226 Difference]: Without dead ends: 20542 [2019-12-27 18:10:40,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20542 states. [2019-12-27 18:10:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20542 to 15618. [2019-12-27 18:10:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15618 states. [2019-12-27 18:10:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 46988 transitions. [2019-12-27 18:10:41,018 INFO L78 Accepts]: Start accepts. Automaton has 15618 states and 46988 transitions. Word has length 56 [2019-12-27 18:10:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:41,018 INFO L462 AbstractCegarLoop]: Abstraction has 15618 states and 46988 transitions. [2019-12-27 18:10:41,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:10:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15618 states and 46988 transitions. [2019-12-27 18:10:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:10:41,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:41,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 18:10:41,034 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 388120898, now seen corresponding path program 4 times [2019-12-27 18:10:41,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:41,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886511504] [2019-12-27 18:10:41,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:41,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886511504] [2019-12-27 18:10:41,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:41,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 18:10:41,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [659638158] [2019-12-27 18:10:41,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:41,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:41,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 260 transitions. [2019-12-27 18:10:41,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:10:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:10:42,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:10:42,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:10:43,457 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 18:10:43,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 18:10:43,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 18:10:43,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 18:10:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:10:43,460 INFO L87 Difference]: Start difference. First operand 15618 states and 46988 transitions. Second operand 36 states. [2019-12-27 18:10:52,106 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 Received shutdown request... [2019-12-27 18:10:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 18:10:53,851 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:10:53,853 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:10:53,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:10:53 BasicIcfg [2019-12-27 18:10:53,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:10:53,855 INFO L168 Benchmark]: Toolchain (without parser) took 229103.75 ms. Allocated memory was 138.4 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,856 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 154.9 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.48 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,857 INFO L168 Benchmark]: Boogie Preprocessor took 51.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,857 INFO L168 Benchmark]: RCFGBuilder took 772.68 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,858 INFO L168 Benchmark]: TraceAbstraction took 227381.71 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 599.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:53,860 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.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 154.9 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.48 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.68 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227381.71 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 599.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (15618states) and FLOYD_HOARE automaton (currently 75 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 96 known predicates. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (15618states) and FLOYD_HOARE automaton (currently 75 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 96 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 227.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 160.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5240 SDtfs, 16902 SDslu, 30585 SDs, 0 SdLazy, 63688 SolverSat, 2657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1359 GetRequests, 217 SyntacticMatches, 51 SemanticMatches, 1090 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79646 ImplicationChecksByTransitivity, 78.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 259453 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 924 ConstructedInterpolants, 0 QuantifiedInterpolants, 276676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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