/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:38:04,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:38:04,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:38:04,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:38:04,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:38:04,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:38:04,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:38:04,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:38:04,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:38:04,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:38:04,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:38:04,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:38:04,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:38:04,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:38:04,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:38:04,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:38:04,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:38:04,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:38:04,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:38:04,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:38:04,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:38:04,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:38:04,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:38:04,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:38:04,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:38:04,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:38:04,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:38:04,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:38:04,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:38:04,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:38:04,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:38:04,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:38:04,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:38:04,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:38:04,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:38:04,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:38:04,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:38:04,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:38:04,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:38:04,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:38:04,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:38:04,509 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-NoLbe.epf [2019-12-27 13:38:04,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:38:04,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:38:04,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:38:04,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:38:04,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:38:04,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:38:04,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:38:04,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:38:04,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:38:04,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:38:04,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:38:04,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:38:04,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:38:04,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:38:04,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:38:04,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:38:04,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:38:04,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:38:04,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:38:04,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:38:04,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:38:04,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:38:04,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:38:04,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:38:04,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:38:04,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:38:04,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:38:04,545 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:38:04,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:38:04,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:38:04,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:38:04,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:38:04,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:38:04,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:38:04,852 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:38:04,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-27 13:38:04,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254cb9bd9/41fb13a6114345279c11487e22846bcb/FLAG4d95a82d9 [2019-12-27 13:38:05,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:38:05,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-27 13:38:05,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254cb9bd9/41fb13a6114345279c11487e22846bcb/FLAG4d95a82d9 [2019-12-27 13:38:05,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254cb9bd9/41fb13a6114345279c11487e22846bcb [2019-12-27 13:38:05,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:38:05,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:38:05,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:38:05,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:38:05,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:38:05,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:38:05" (1/1) ... [2019-12-27 13:38:05,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:05, skipping insertion in model container [2019-12-27 13:38:05,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:38:05" (1/1) ... [2019-12-27 13:38:05,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:38:05,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:38:06,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:38:06,348 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:38:06,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:38:06,540 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:38:06,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06 WrapperNode [2019-12-27 13:38:06,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:38:06,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:38:06,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:38:06,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:38:06,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:38:06,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:38:06,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:38:06,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:38:06,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... [2019-12-27 13:38:06,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:38:06,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:38:06,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:38:06,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:38:06,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:38:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:38:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:38:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:38:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:38:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:38:06,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:38:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:38:06,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:38:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:38:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:38:06,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:38:06,720 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 13:38:07,493 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:38:07,494 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:38:07,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:38:07 BoogieIcfgContainer [2019-12-27 13:38:07,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:38:07,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:38:07,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:38:07,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:38:07,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:38:05" (1/3) ... [2019-12-27 13:38:07,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60598326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:38:07, skipping insertion in model container [2019-12-27 13:38:07,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:06" (2/3) ... [2019-12-27 13:38:07,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60598326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:38:07, skipping insertion in model container [2019-12-27 13:38:07,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:38:07" (3/3) ... [2019-12-27 13:38:07,508 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2019-12-27 13:38:07,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:38:07,517 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:38:07,525 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:38:07,526 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:38:07,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:07,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:38:07,628 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:38:07,628 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:38:07,628 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:38:07,629 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:38:07,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:38:07,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:38:07,629 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:38:07,629 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:38:07,644 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-27 13:38:08,952 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-27 13:38:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-27 13:38:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 13:38:08,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:08,964 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] [2019-12-27 13:38:08,965 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-27 13:38:08,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:08,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174729432] [2019-12-27 13:38:08,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:09,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174729432] [2019-12-27 13:38:09,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:09,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:09,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722867945] [2019-12-27 13:38:09,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:09,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:09,501 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-27 13:38:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:10,238 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-27 13:38:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:38:10,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 13:38:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:10,475 INFO L225 Difference]: With dead ends: 23454 [2019-12-27 13:38:10,476 INFO L226 Difference]: Without dead ends: 21278 [2019-12-27 13:38:10,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-27 13:38:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-27 13:38:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-27 13:38:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-27 13:38:12,297 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-27 13:38:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:12,298 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-27 13:38:12,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-27 13:38:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 13:38:12,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:12,304 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] [2019-12-27 13:38:12,305 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-27 13:38:12,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:12,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487829241] [2019-12-27 13:38:12,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:12,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487829241] [2019-12-27 13:38:12,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:12,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:12,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3789867] [2019-12-27 13:38:12,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:12,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:12,413 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-27 13:38:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:13,549 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-27 13:38:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:13,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 13:38:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:13,706 INFO L225 Difference]: With dead ends: 34712 [2019-12-27 13:38:13,706 INFO L226 Difference]: Without dead ends: 34568 [2019-12-27 13:38:13,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-27 13:38:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-27 13:38:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 13:38:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-27 13:38:15,981 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-27 13:38:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:15,983 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-27 13:38:15,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-27 13:38:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 13:38:15,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:15,988 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] [2019-12-27 13:38:15,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-27 13:38:15,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:15,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928927204] [2019-12-27 13:38:15,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:16,087 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 13:38:16,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928927204] [2019-12-27 13:38:16,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:16,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:16,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691464566] [2019-12-27 13:38:16,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:16,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:16,091 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-27 13:38:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:16,977 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-27 13:38:16,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:16,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 13:38:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:17,237 INFO L225 Difference]: With dead ends: 40220 [2019-12-27 13:38:17,237 INFO L226 Difference]: Without dead ends: 40060 [2019-12-27 13:38:17,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-27 13:38:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-27 13:38:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 13:38:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-27 13:38:19,629 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-27 13:38:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:19,629 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-27 13:38:19,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-27 13:38:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 13:38:19,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:19,649 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] [2019-12-27 13:38:19,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-27 13:38:19,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:19,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585415974] [2019-12-27 13:38:19,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:19,781 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 13:38:19,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585415974] [2019-12-27 13:38:19,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:19,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:19,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81861850] [2019-12-27 13:38:19,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:19,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:19,784 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-27 13:38:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:20,957 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-27 13:38:20,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:38:20,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 13:38:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:21,050 INFO L225 Difference]: With dead ends: 45669 [2019-12-27 13:38:21,051 INFO L226 Difference]: Without dead ends: 45525 [2019-12-27 13:38:21,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:38:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-27 13:38:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-27 13:38:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-27 13:38:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-27 13:38:23,415 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-27 13:38:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-27 13:38:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-27 13:38:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 13:38:23,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:23,450 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, 1, 1, 1] [2019-12-27 13:38:23,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-27 13:38:23,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:23,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568234945] [2019-12-27 13:38:23,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:23,544 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 13:38:23,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568234945] [2019-12-27 13:38:23,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:23,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:23,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295688829] [2019-12-27 13:38:23,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:23,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:23,547 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-27 13:38:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:24,513 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-27 13:38:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:38:24,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 13:38:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:24,652 INFO L225 Difference]: With dead ends: 46076 [2019-12-27 13:38:24,652 INFO L226 Difference]: Without dead ends: 45836 [2019-12-27 13:38:24,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:38:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-27 13:38:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-27 13:38:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-27 13:38:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-27 13:38:27,282 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-27 13:38:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:27,283 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-27 13:38:27,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-27 13:38:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 13:38:27,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:27,320 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, 1, 1, 1, 1, 1] [2019-12-27 13:38:27,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-27 13:38:27,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868494276] [2019-12-27 13:38:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:27,374 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 13:38:27,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868494276] [2019-12-27 13:38:27,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:27,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:38:27,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064603189] [2019-12-27 13:38:27,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:38:27,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:38:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:27,377 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-27 13:38:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:27,607 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-27 13:38:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:38:27,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 13:38:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:27,714 INFO L225 Difference]: With dead ends: 50263 [2019-12-27 13:38:27,715 INFO L226 Difference]: Without dead ends: 50263 [2019-12-27 13:38:27,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-27 13:38:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-27 13:38:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-27 13:38:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-27 13:38:28,852 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-27 13:38:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-27 13:38:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:38:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-27 13:38:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 13:38:28,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:28,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:28,887 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-27 13:38:28,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:28,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274795164] [2019-12-27 13:38:28,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:28,996 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 13:38:28,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274795164] [2019-12-27 13:38:28,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:28,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:28,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420988587] [2019-12-27 13:38:28,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:28,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:28,998 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-27 13:38:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:30,425 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-27 13:38:30,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:38:30,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 13:38:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:30,543 INFO L225 Difference]: With dead ends: 55891 [2019-12-27 13:38:30,543 INFO L226 Difference]: Without dead ends: 55651 [2019-12-27 13:38:30,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:38:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-27 13:38:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-27 13:38:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-27 13:38:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-27 13:38:33,263 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-27 13:38:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:33,264 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-27 13:38:33,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-27 13:38:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:38:33,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:33,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:33,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-27 13:38:33,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:33,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891375769] [2019-12-27 13:38:33,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:33,374 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 13:38:33,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891375769] [2019-12-27 13:38:33,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:33,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:33,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860595611] [2019-12-27 13:38:33,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:33,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:33,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:33,376 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-27 13:38:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:33,776 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-27 13:38:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:33,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 13:38:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:33,930 INFO L225 Difference]: With dead ends: 69403 [2019-12-27 13:38:33,930 INFO L226 Difference]: Without dead ends: 69403 [2019-12-27 13:38:33,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:38:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-27 13:38:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-27 13:38:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-27 13:38:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-27 13:38:38,216 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-27 13:38:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:38,217 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-27 13:38:38,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-27 13:38:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:38:38,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:38,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:38,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-27 13:38:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:38,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88137664] [2019-12-27 13:38:38,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:38,384 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 13:38:38,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88137664] [2019-12-27 13:38:38,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:38,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405787299] [2019-12-27 13:38:38,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:38,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:38,386 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-27 13:38:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:39,643 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-27 13:38:39,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:38:39,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 13:38:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:39,779 INFO L225 Difference]: With dead ends: 63822 [2019-12-27 13:38:39,779 INFO L226 Difference]: Without dead ends: 63622 [2019-12-27 13:38:39,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 13:38:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-27 13:38:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-27 13:38:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-27 13:38:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-27 13:38:41,053 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-27 13:38:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:41,055 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-27 13:38:41,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-27 13:38:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:41,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:41,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:41,113 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-27 13:38:41,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887768236] [2019-12-27 13:38:41,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:41,217 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 13:38:41,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887768236] [2019-12-27 13:38:41,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:41,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:41,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088754791] [2019-12-27 13:38:41,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:41,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:41,220 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-27 13:38:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:42,021 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-27 13:38:42,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:42,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 13:38:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:42,782 INFO L225 Difference]: With dead ends: 75817 [2019-12-27 13:38:42,782 INFO L226 Difference]: Without dead ends: 75173 [2019-12-27 13:38:42,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-27 13:38:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-27 13:38:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-27 13:38:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-27 13:38:47,323 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-27 13:38:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:47,323 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-27 13:38:47,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-27 13:38:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:47,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:47,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:47,397 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-27 13:38:47,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:47,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199974010] [2019-12-27 13:38:47,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:47,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199974010] [2019-12-27 13:38:47,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:47,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:47,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527827864] [2019-12-27 13:38:47,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:47,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:47,513 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-27 13:38:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:48,667 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-27 13:38:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:38:48,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 13:38:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:48,898 INFO L225 Difference]: With dead ends: 92241 [2019-12-27 13:38:48,898 INFO L226 Difference]: Without dead ends: 92241 [2019-12-27 13:38:48,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:38:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-27 13:38:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-27 13:38:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-27 13:38:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-27 13:38:50,773 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-27 13:38:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:50,773 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-27 13:38:50,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-27 13:38:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:50,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:50,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:50,854 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:50,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-27 13:38:50,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:50,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539466363] [2019-12-27 13:38:50,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:50,932 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 13:38:50,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539466363] [2019-12-27 13:38:50,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:50,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:38:50,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957968759] [2019-12-27 13:38:50,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:38:50,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:38:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:50,934 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 3 states. [2019-12-27 13:38:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:51,827 INFO L93 Difference]: Finished difference Result 63509 states and 230498 transitions. [2019-12-27 13:38:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:38:51,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 13:38:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:51,970 INFO L225 Difference]: With dead ends: 63509 [2019-12-27 13:38:51,970 INFO L226 Difference]: Without dead ends: 63347 [2019-12-27 13:38:51,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:38:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63347 states. [2019-12-27 13:38:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63347 to 63307. [2019-12-27 13:38:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63307 states. [2019-12-27 13:38:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63307 states to 63307 states and 229913 transitions. [2019-12-27 13:38:54,046 INFO L78 Accepts]: Start accepts. Automaton has 63307 states and 229913 transitions. Word has length 68 [2019-12-27 13:38:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:54,046 INFO L462 AbstractCegarLoop]: Abstraction has 63307 states and 229913 transitions. [2019-12-27 13:38:54,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:38:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 63307 states and 229913 transitions. [2019-12-27 13:38:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 13:38:54,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:54,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:54,100 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1567683976, now seen corresponding path program 1 times [2019-12-27 13:38:54,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:54,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378924043] [2019-12-27 13:38:54,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:54,186 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 13:38:54,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378924043] [2019-12-27 13:38:54,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:54,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:54,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167979591] [2019-12-27 13:38:54,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:54,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:54,189 INFO L87 Difference]: Start difference. First operand 63307 states and 229913 transitions. Second operand 5 states. [2019-12-27 13:38:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:54,984 INFO L93 Difference]: Finished difference Result 84435 states and 303683 transitions. [2019-12-27 13:38:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:54,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 13:38:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:55,259 INFO L225 Difference]: With dead ends: 84435 [2019-12-27 13:38:55,259 INFO L226 Difference]: Without dead ends: 84239 [2019-12-27 13:38:55,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2019-12-27 13:38:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 76154. [2019-12-27 13:38:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76154 states. [2019-12-27 13:38:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76154 states to 76154 states and 275571 transitions. [2019-12-27 13:38:59,624 INFO L78 Accepts]: Start accepts. Automaton has 76154 states and 275571 transitions. Word has length 69 [2019-12-27 13:38:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:59,624 INFO L462 AbstractCegarLoop]: Abstraction has 76154 states and 275571 transitions. [2019-12-27 13:38:59,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 76154 states and 275571 transitions. [2019-12-27 13:38:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 13:38:59,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:59,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:59,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash -322919495, now seen corresponding path program 1 times [2019-12-27 13:38:59,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:59,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142161388] [2019-12-27 13:38:59,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:59,797 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 13:38:59,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142161388] [2019-12-27 13:38:59,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:59,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:59,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160590013] [2019-12-27 13:38:59,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:59,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:59,799 INFO L87 Difference]: Start difference. First operand 76154 states and 275571 transitions. Second operand 4 states. [2019-12-27 13:38:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:59,913 INFO L93 Difference]: Finished difference Result 19622 states and 62292 transitions. [2019-12-27 13:38:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:59,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 13:38:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:59,954 INFO L225 Difference]: With dead ends: 19622 [2019-12-27 13:38:59,955 INFO L226 Difference]: Without dead ends: 19144 [2019-12-27 13:38:59,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:38:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2019-12-27 13:39:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19132. [2019-12-27 13:39:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2019-12-27 13:39:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 60787 transitions. [2019-12-27 13:39:00,215 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 60787 transitions. Word has length 69 [2019-12-27 13:39:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:00,216 INFO L462 AbstractCegarLoop]: Abstraction has 19132 states and 60787 transitions. [2019-12-27 13:39:00,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:39:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 60787 transitions. [2019-12-27 13:39:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:39:00,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:00,232 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, 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 13:39:00,232 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash 992958347, now seen corresponding path program 1 times [2019-12-27 13:39:00,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:00,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831193877] [2019-12-27 13:39:00,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:00,291 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 13:39:00,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831193877] [2019-12-27 13:39:00,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:00,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:39:00,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958205692] [2019-12-27 13:39:00,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:39:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:39:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:39:00,293 INFO L87 Difference]: Start difference. First operand 19132 states and 60787 transitions. Second operand 4 states. [2019-12-27 13:39:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:01,074 INFO L93 Difference]: Finished difference Result 24082 states and 75455 transitions. [2019-12-27 13:39:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:39:01,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-27 13:39:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:01,111 INFO L225 Difference]: With dead ends: 24082 [2019-12-27 13:39:01,111 INFO L226 Difference]: Without dead ends: 24082 [2019-12-27 13:39:01,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:39:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24082 states. [2019-12-27 13:39:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24082 to 19972. [2019-12-27 13:39:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-12-27 13:39:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 63154 transitions. [2019-12-27 13:39:01,395 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 63154 transitions. Word has length 78 [2019-12-27 13:39:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:01,395 INFO L462 AbstractCegarLoop]: Abstraction has 19972 states and 63154 transitions. [2019-12-27 13:39:01,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:39:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 63154 transitions. [2019-12-27 13:39:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:39:01,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:01,412 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, 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 13:39:01,413 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 738221802, now seen corresponding path program 1 times [2019-12-27 13:39:01,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:01,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759904765] [2019-12-27 13:39:01,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:01,517 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 13:39:01,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759904765] [2019-12-27 13:39:01,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:01,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:39:01,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148382079] [2019-12-27 13:39:01,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:39:01,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:39:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:01,521 INFO L87 Difference]: Start difference. First operand 19972 states and 63154 transitions. Second operand 8 states. [2019-12-27 13:39:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:02,457 INFO L93 Difference]: Finished difference Result 22078 states and 69346 transitions. [2019-12-27 13:39:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 13:39:02,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-27 13:39:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:02,491 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 13:39:02,491 INFO L226 Difference]: Without dead ends: 22030 [2019-12-27 13:39:02,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 13:39:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22030 states. [2019-12-27 13:39:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22030 to 19444. [2019-12-27 13:39:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19444 states. [2019-12-27 13:39:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19444 states to 19444 states and 61656 transitions. [2019-12-27 13:39:02,768 INFO L78 Accepts]: Start accepts. Automaton has 19444 states and 61656 transitions. Word has length 78 [2019-12-27 13:39:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:02,768 INFO L462 AbstractCegarLoop]: Abstraction has 19444 states and 61656 transitions. [2019-12-27 13:39:02,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:39:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19444 states and 61656 transitions. [2019-12-27 13:39:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:02,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:02,788 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, 1, 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 13:39:02,788 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1156410968, now seen corresponding path program 1 times [2019-12-27 13:39:02,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:02,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329445855] [2019-12-27 13:39:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:02,876 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 13:39:02,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329445855] [2019-12-27 13:39:02,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:02,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:39:02,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080581851] [2019-12-27 13:39:02,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:39:02,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:39:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:02,879 INFO L87 Difference]: Start difference. First operand 19444 states and 61656 transitions. Second operand 8 states. [2019-12-27 13:39:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:06,018 INFO L93 Difference]: Finished difference Result 50438 states and 153674 transitions. [2019-12-27 13:39:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 13:39:06,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-27 13:39:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:06,097 INFO L225 Difference]: With dead ends: 50438 [2019-12-27 13:39:06,097 INFO L226 Difference]: Without dead ends: 49739 [2019-12-27 13:39:06,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 13:39:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49739 states. [2019-12-27 13:39:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49739 to 29972. [2019-12-27 13:39:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29972 states. [2019-12-27 13:39:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29972 states to 29972 states and 93586 transitions. [2019-12-27 13:39:06,619 INFO L78 Accepts]: Start accepts. Automaton has 29972 states and 93586 transitions. Word has length 81 [2019-12-27 13:39:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:06,619 INFO L462 AbstractCegarLoop]: Abstraction has 29972 states and 93586 transitions. [2019-12-27 13:39:06,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:39:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 29972 states and 93586 transitions. [2019-12-27 13:39:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:06,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:06,647 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, 1, 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 13:39:06,647 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash -194796951, now seen corresponding path program 1 times [2019-12-27 13:39:06,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:06,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233952360] [2019-12-27 13:39:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:06,756 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 13:39:06,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233952360] [2019-12-27 13:39:06,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:06,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:06,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585260507] [2019-12-27 13:39:06,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:06,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:06,759 INFO L87 Difference]: Start difference. First operand 29972 states and 93586 transitions. Second operand 6 states. [2019-12-27 13:39:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:07,409 INFO L93 Difference]: Finished difference Result 31402 states and 97511 transitions. [2019-12-27 13:39:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:07,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:39:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:07,493 INFO L225 Difference]: With dead ends: 31402 [2019-12-27 13:39:07,493 INFO L226 Difference]: Without dead ends: 31402 [2019-12-27 13:39:07,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-12-27 13:39:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-12-27 13:39:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-12-27 13:39:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92417 transitions. [2019-12-27 13:39:07,999 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92417 transitions. Word has length 81 [2019-12-27 13:39:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:07,999 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92417 transitions. [2019-12-27 13:39:07,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92417 transitions. [2019-12-27 13:39:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:08,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:08,027 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, 1, 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 13:39:08,027 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2130457238, now seen corresponding path program 1 times [2019-12-27 13:39:08,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:08,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642629745] [2019-12-27 13:39:08,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:08,136 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 13:39:08,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642629745] [2019-12-27 13:39:08,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:08,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:08,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129688982] [2019-12-27 13:39:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:08,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:08,138 INFO L87 Difference]: Start difference. First operand 29633 states and 92417 transitions. Second operand 7 states. [2019-12-27 13:39:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:09,184 INFO L93 Difference]: Finished difference Result 31147 states and 96573 transitions. [2019-12-27 13:39:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:39:09,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-27 13:39:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:09,231 INFO L225 Difference]: With dead ends: 31147 [2019-12-27 13:39:09,232 INFO L226 Difference]: Without dead ends: 31147 [2019-12-27 13:39:09,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:39:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-12-27 13:39:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-12-27 13:39:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-27 13:39:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93248 transitions. [2019-12-27 13:39:09,638 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93248 transitions. Word has length 81 [2019-12-27 13:39:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:09,639 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93248 transitions. [2019-12-27 13:39:09,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93248 transitions. [2019-12-27 13:39:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:09,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:09,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:09,668 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691477, now seen corresponding path program 1 times [2019-12-27 13:39:09,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:09,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320371726] [2019-12-27 13:39:09,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:39:09,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320371726] [2019-12-27 13:39:09,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:09,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:09,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895191294] [2019-12-27 13:39:09,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:09,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:09,760 INFO L87 Difference]: Start difference. First operand 29965 states and 93248 transitions. Second operand 5 states. [2019-12-27 13:39:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:09,816 INFO L93 Difference]: Finished difference Result 4528 states and 11184 transitions. [2019-12-27 13:39:09,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:39:09,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:39:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:09,822 INFO L225 Difference]: With dead ends: 4528 [2019-12-27 13:39:09,822 INFO L226 Difference]: Without dead ends: 3738 [2019-12-27 13:39:09,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-27 13:39:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3435. [2019-12-27 13:39:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-27 13:39:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 8385 transitions. [2019-12-27 13:39:09,874 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 8385 transitions. Word has length 81 [2019-12-27 13:39:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 8385 transitions. [2019-12-27 13:39:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 8385 transitions. [2019-12-27 13:39:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:09,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:09,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:09,879 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash 636830190, now seen corresponding path program 1 times [2019-12-27 13:39:09,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:09,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662106399] [2019-12-27 13:39:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:10,054 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 13:39:10,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662106399] [2019-12-27 13:39:10,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:10,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509077432] [2019-12-27 13:39:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:10,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:10,058 INFO L87 Difference]: Start difference. First operand 3435 states and 8385 transitions. Second operand 6 states. [2019-12-27 13:39:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:10,394 INFO L93 Difference]: Finished difference Result 3465 states and 8375 transitions. [2019-12-27 13:39:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:39:10,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:10,399 INFO L225 Difference]: With dead ends: 3465 [2019-12-27 13:39:10,400 INFO L226 Difference]: Without dead ends: 3465 [2019-12-27 13:39:10,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:39:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-27 13:39:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3315. [2019-12-27 13:39:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2019-12-27 13:39:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 8065 transitions. [2019-12-27 13:39:10,450 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 8065 transitions. Word has length 93 [2019-12-27 13:39:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:10,451 INFO L462 AbstractCegarLoop]: Abstraction has 3315 states and 8065 transitions. [2019-12-27 13:39:10,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 8065 transitions. [2019-12-27 13:39:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:10,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:10,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:10,457 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash 966595951, now seen corresponding path program 1 times [2019-12-27 13:39:10,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:10,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045661456] [2019-12-27 13:39:10,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:10,519 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 13:39:10,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045661456] [2019-12-27 13:39:10,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:10,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:39:10,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505953741] [2019-12-27 13:39:10,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:39:10,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:39:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:39:10,522 INFO L87 Difference]: Start difference. First operand 3315 states and 8065 transitions. Second operand 4 states. [2019-12-27 13:39:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:10,667 INFO L93 Difference]: Finished difference Result 4130 states and 9838 transitions. [2019-12-27 13:39:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:39:10,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-27 13:39:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:10,672 INFO L225 Difference]: With dead ends: 4130 [2019-12-27 13:39:10,672 INFO L226 Difference]: Without dead ends: 4073 [2019-12-27 13:39:10,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:39:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-12-27 13:39:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3580. [2019-12-27 13:39:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-27 13:39:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8651 transitions. [2019-12-27 13:39:10,708 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8651 transitions. Word has length 93 [2019-12-27 13:39:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:10,709 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8651 transitions. [2019-12-27 13:39:10,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:39:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8651 transitions. [2019-12-27 13:39:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:10,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:10,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:10,712 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1662428928, now seen corresponding path program 1 times [2019-12-27 13:39:10,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:10,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149006840] [2019-12-27 13:39:10,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:10,785 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 13:39:10,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149006840] [2019-12-27 13:39:10,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:10,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:10,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976731161] [2019-12-27 13:39:10,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:10,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:10,796 INFO L87 Difference]: Start difference. First operand 3580 states and 8651 transitions. Second operand 5 states. [2019-12-27 13:39:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:11,321 INFO L93 Difference]: Finished difference Result 5452 states and 13125 transitions. [2019-12-27 13:39:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:11,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:39:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:11,330 INFO L225 Difference]: With dead ends: 5452 [2019-12-27 13:39:11,330 INFO L226 Difference]: Without dead ends: 5452 [2019-12-27 13:39:11,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-27 13:39:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3913. [2019-12-27 13:39:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-27 13:39:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 9527 transitions. [2019-12-27 13:39:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 9527 transitions. Word has length 93 [2019-12-27 13:39:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:11,399 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 9527 transitions. [2019-12-27 13:39:11,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 9527 transitions. [2019-12-27 13:39:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:11,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:11,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:11,404 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1945579392, now seen corresponding path program 1 times [2019-12-27 13:39:11,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:11,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827096285] [2019-12-27 13:39:11,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:11,506 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 13:39:11,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827096285] [2019-12-27 13:39:11,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:11,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:11,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766218837] [2019-12-27 13:39:11,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:11,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:11,509 INFO L87 Difference]: Start difference. First operand 3913 states and 9527 transitions. Second operand 6 states. [2019-12-27 13:39:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:11,788 INFO L93 Difference]: Finished difference Result 4703 states and 11075 transitions. [2019-12-27 13:39:11,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:39:11,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:11,797 INFO L225 Difference]: With dead ends: 4703 [2019-12-27 13:39:11,797 INFO L226 Difference]: Without dead ends: 4703 [2019-12-27 13:39:11,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:39:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2019-12-27 13:39:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4080. [2019-12-27 13:39:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-12-27 13:39:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 9838 transitions. [2019-12-27 13:39:11,883 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 9838 transitions. Word has length 93 [2019-12-27 13:39:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:11,884 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 9838 transitions. [2019-12-27 13:39:11,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 9838 transitions. [2019-12-27 13:39:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:11,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:11,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:11,892 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash 648647425, now seen corresponding path program 1 times [2019-12-27 13:39:11,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:11,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57551259] [2019-12-27 13:39:11,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:39:11,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57551259] [2019-12-27 13:39:11,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:11,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:11,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882209802] [2019-12-27 13:39:11,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:11,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:11,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:11,990 INFO L87 Difference]: Start difference. First operand 4080 states and 9838 transitions. Second operand 5 states. [2019-12-27 13:39:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:12,234 INFO L93 Difference]: Finished difference Result 4870 states and 11542 transitions. [2019-12-27 13:39:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:12,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:39:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:12,241 INFO L225 Difference]: With dead ends: 4870 [2019-12-27 13:39:12,241 INFO L226 Difference]: Without dead ends: 4824 [2019-12-27 13:39:12,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-27 13:39:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4158. [2019-12-27 13:39:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-27 13:39:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 10005 transitions. [2019-12-27 13:39:12,284 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 10005 transitions. Word has length 93 [2019-12-27 13:39:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:12,284 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 10005 transitions. [2019-12-27 13:39:12,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 10005 transitions. [2019-12-27 13:39:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:12,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:12,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:12,288 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 970728323, now seen corresponding path program 1 times [2019-12-27 13:39:12,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:12,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571159702] [2019-12-27 13:39:12,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:12,412 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 13:39:12,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571159702] [2019-12-27 13:39:12,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:12,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:12,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560354365] [2019-12-27 13:39:12,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:12,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:12,415 INFO L87 Difference]: Start difference. First operand 4158 states and 10005 transitions. Second operand 7 states. [2019-12-27 13:39:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,340 INFO L93 Difference]: Finished difference Result 5046 states and 11917 transitions. [2019-12-27 13:39:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:39:13,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-27 13:39:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,347 INFO L225 Difference]: With dead ends: 5046 [2019-12-27 13:39:13,347 INFO L226 Difference]: Without dead ends: 5002 [2019-12-27 13:39:13,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:39:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2019-12-27 13:39:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4203. [2019-12-27 13:39:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4203 states. [2019-12-27 13:39:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 10074 transitions. [2019-12-27 13:39:13,395 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 10074 transitions. Word has length 93 [2019-12-27 13:39:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:13,395 INFO L462 AbstractCegarLoop]: Abstraction has 4203 states and 10074 transitions. [2019-12-27 13:39:13,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 10074 transitions. [2019-12-27 13:39:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:13,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:13,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:13,400 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 83557860, now seen corresponding path program 1 times [2019-12-27 13:39:13,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:13,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607223947] [2019-12-27 13:39:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:13,483 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 13:39:13,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607223947] [2019-12-27 13:39:13,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:13,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:13,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701639962] [2019-12-27 13:39:13,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:13,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:13,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:13,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:13,485 INFO L87 Difference]: Start difference. First operand 4203 states and 10074 transitions. Second operand 6 states. [2019-12-27 13:39:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,636 INFO L93 Difference]: Finished difference Result 3248 states and 7928 transitions. [2019-12-27 13:39:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:13,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,642 INFO L225 Difference]: With dead ends: 3248 [2019-12-27 13:39:13,642 INFO L226 Difference]: Without dead ends: 3248 [2019-12-27 13:39:13,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-12-27 13:39:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2988. [2019-12-27 13:39:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-27 13:39:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7372 transitions. [2019-12-27 13:39:13,699 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7372 transitions. Word has length 93 [2019-12-27 13:39:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:13,700 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7372 transitions. [2019-12-27 13:39:13,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7372 transitions. [2019-12-27 13:39:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:13,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:13,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:13,705 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948161, now seen corresponding path program 1 times [2019-12-27 13:39:13,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:13,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788411579] [2019-12-27 13:39:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:13,841 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 13:39:13,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788411579] [2019-12-27 13:39:13,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:13,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:13,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023667118] [2019-12-27 13:39:13,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:13,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:13,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:13,844 INFO L87 Difference]: Start difference. First operand 2988 states and 7372 transitions. Second operand 6 states. [2019-12-27 13:39:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,959 INFO L93 Difference]: Finished difference Result 3169 states and 7662 transitions. [2019-12-27 13:39:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:13,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:39:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,964 INFO L225 Difference]: With dead ends: 3169 [2019-12-27 13:39:13,964 INFO L226 Difference]: Without dead ends: 3124 [2019-12-27 13:39:13,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-12-27 13:39:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3050. [2019-12-27 13:39:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-12-27 13:39:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 7431 transitions. [2019-12-27 13:39:14,011 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 7431 transitions. Word has length 95 [2019-12-27 13:39:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,011 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 7431 transitions. [2019-12-27 13:39:14,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 7431 transitions. [2019-12-27 13:39:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:14,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:14,016 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1737866465, now seen corresponding path program 2 times [2019-12-27 13:39:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959736299] [2019-12-27 13:39:14,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,126 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 13:39:14,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959736299] [2019-12-27 13:39:14,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:14,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983789287] [2019-12-27 13:39:14,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:14,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:14,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:14,128 INFO L87 Difference]: Start difference. First operand 3050 states and 7431 transitions. Second operand 6 states. [2019-12-27 13:39:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:14,330 INFO L93 Difference]: Finished difference Result 3282 states and 7887 transitions. [2019-12-27 13:39:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:39:14,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:39:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:14,334 INFO L225 Difference]: With dead ends: 3282 [2019-12-27 13:39:14,334 INFO L226 Difference]: Without dead ends: 3282 [2019-12-27 13:39:14,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:39:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-27 13:39:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3176. [2019-12-27 13:39:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-12-27 13:39:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 7680 transitions. [2019-12-27 13:39:14,367 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 7680 transitions. Word has length 95 [2019-12-27 13:39:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,367 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 7680 transitions. [2019-12-27 13:39:14,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 7680 transitions. [2019-12-27 13:39:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:14,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:14,371 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1408100704, now seen corresponding path program 1 times [2019-12-27 13:39:14,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085996001] [2019-12-27 13:39:14,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:39:14,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085996001] [2019-12-27 13:39:14,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:14,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610292383] [2019-12-27 13:39:14,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:14,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:14,425 INFO L87 Difference]: Start difference. First operand 3176 states and 7680 transitions. Second operand 5 states. [2019-12-27 13:39:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:14,584 INFO L93 Difference]: Finished difference Result 3783 states and 8972 transitions. [2019-12-27 13:39:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:14,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:39:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:14,592 INFO L225 Difference]: With dead ends: 3783 [2019-12-27 13:39:14,592 INFO L226 Difference]: Without dead ends: 3783 [2019-12-27 13:39:14,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-12-27 13:39:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3514. [2019-12-27 13:39:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-27 13:39:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 8390 transitions. [2019-12-27 13:39:14,664 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 8390 transitions. Word has length 95 [2019-12-27 13:39:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,665 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 8390 transitions. [2019-12-27 13:39:14,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 8390 transitions. [2019-12-27 13:39:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:14,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:14,672 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-27 13:39:14,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485569882] [2019-12-27 13:39:14,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,788 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 13:39:14,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485569882] [2019-12-27 13:39:14,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:14,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617482311] [2019-12-27 13:39:14,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:14,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:14,791 INFO L87 Difference]: Start difference. First operand 3514 states and 8390 transitions. Second operand 5 states. [2019-12-27 13:39:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:14,995 INFO L93 Difference]: Finished difference Result 3181 states and 7442 transitions. [2019-12-27 13:39:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:14,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:39:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,000 INFO L225 Difference]: With dead ends: 3181 [2019-12-27 13:39:15,000 INFO L226 Difference]: Without dead ends: 3163 [2019-12-27 13:39:15,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-12-27 13:39:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2489. [2019-12-27 13:39:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-12-27 13:39:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5939 transitions. [2019-12-27 13:39:15,028 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5939 transitions. Word has length 95 [2019-12-27 13:39:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,029 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 5939 transitions. [2019-12-27 13:39:15,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5939 transitions. [2019-12-27 13:39:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:15,031 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-27 13:39:15,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282433076] [2019-12-27 13:39:15,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,129 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 13:39:15,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282433076] [2019-12-27 13:39:15,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:15,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177195074] [2019-12-27 13:39:15,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:15,131 INFO L87 Difference]: Start difference. First operand 2489 states and 5939 transitions. Second operand 6 states. [2019-12-27 13:39:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,237 INFO L93 Difference]: Finished difference Result 2568 states and 6098 transitions. [2019-12-27 13:39:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:15,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:39:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,241 INFO L225 Difference]: With dead ends: 2568 [2019-12-27 13:39:15,242 INFO L226 Difference]: Without dead ends: 2568 [2019-12-27 13:39:15,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-12-27 13:39:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2463. [2019-12-27 13:39:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-27 13:39:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5887 transitions. [2019-12-27 13:39:15,279 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5887 transitions. Word has length 95 [2019-12-27 13:39:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,279 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5887 transitions. [2019-12-27 13:39:15,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5887 transitions. [2019-12-27 13:39:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:15,283 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2136197344, now seen corresponding path program 1 times [2019-12-27 13:39:15,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558067260] [2019-12-27 13:39:15,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,371 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 13:39:15,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558067260] [2019-12-27 13:39:15,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:15,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436424827] [2019-12-27 13:39:15,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:15,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:15,374 INFO L87 Difference]: Start difference. First operand 2463 states and 5887 transitions. Second operand 5 states. [2019-12-27 13:39:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,417 INFO L93 Difference]: Finished difference Result 3753 states and 9136 transitions. [2019-12-27 13:39:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:39:15,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:39:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,422 INFO L225 Difference]: With dead ends: 3753 [2019-12-27 13:39:15,423 INFO L226 Difference]: Without dead ends: 3753 [2019-12-27 13:39:15,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2019-12-27 13:39:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 2353. [2019-12-27 13:39:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-27 13:39:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 5613 transitions. [2019-12-27 13:39:15,452 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 5613 transitions. Word has length 95 [2019-12-27 13:39:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,452 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 5613 transitions. [2019-12-27 13:39:15,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 5613 transitions. [2019-12-27 13:39:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:15,455 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-27 13:39:15,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139796123] [2019-12-27 13:39:15,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,567 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 13:39:15,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139796123] [2019-12-27 13:39:15,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:15,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984789719] [2019-12-27 13:39:15,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:15,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:15,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:15,569 INFO L87 Difference]: Start difference. First operand 2353 states and 5613 transitions. Second operand 7 states. [2019-12-27 13:39:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,666 INFO L93 Difference]: Finished difference Result 3953 states and 9579 transitions. [2019-12-27 13:39:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:15,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 13:39:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,670 INFO L225 Difference]: With dead ends: 3953 [2019-12-27 13:39:15,671 INFO L226 Difference]: Without dead ends: 1788 [2019-12-27 13:39:15,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:39:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-12-27 13:39:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2019-12-27 13:39:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2019-12-27 13:39:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4325 transitions. [2019-12-27 13:39:15,695 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4325 transitions. Word has length 95 [2019-12-27 13:39:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,696 INFO L462 AbstractCegarLoop]: Abstraction has 1788 states and 4325 transitions. [2019-12-27 13:39:15,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4325 transitions. [2019-12-27 13:39:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:15,698 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-27 13:39:15,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283879403] [2019-12-27 13:39:15,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,830 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 13:39:15,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283879403] [2019-12-27 13:39:15,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:39:15,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571476083] [2019-12-27 13:39:15,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:39:15,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:39:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:39:15,832 INFO L87 Difference]: Start difference. First operand 1788 states and 4325 transitions. Second operand 11 states. [2019-12-27 13:39:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:16,119 INFO L93 Difference]: Finished difference Result 3218 states and 7882 transitions. [2019-12-27 13:39:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:39:16,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-27 13:39:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:16,122 INFO L225 Difference]: With dead ends: 3218 [2019-12-27 13:39:16,122 INFO L226 Difference]: Without dead ends: 2318 [2019-12-27 13:39:16,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:39:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-27 13:39:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2206. [2019-12-27 13:39:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-27 13:39:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 5235 transitions. [2019-12-27 13:39:16,143 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 5235 transitions. Word has length 95 [2019-12-27 13:39:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:16,143 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 5235 transitions. [2019-12-27 13:39:16,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:39:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 5235 transitions. [2019-12-27 13:39:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:16,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:16,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:16,145 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:16,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-27 13:39:16,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:16,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157369112] [2019-12-27 13:39:16,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:39:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:39:16,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:39:16,244 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:39:16,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:39:16 BasicIcfg [2019-12-27 13:39:16,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:39:16,413 INFO L168 Benchmark]: Toolchain (without parser) took 70625.73 ms. Allocated memory was 141.0 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,414 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 141.0 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.75 ms. Allocated memory was 141.0 MB in the beginning and 205.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 160.2 MB in the end (delta: -58.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.14 ms. Allocated memory is still 205.5 MB. Free memory was 160.2 MB in the beginning and 157.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,415 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 205.5 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,415 INFO L168 Benchmark]: RCFGBuilder took 844.80 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 111.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,416 INFO L168 Benchmark]: TraceAbstraction took 68913.43 ms. Allocated memory was 205.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 110.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 13:39:16,418 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.51 ms. Allocated memory is still 141.0 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.75 ms. Allocated memory was 141.0 MB in the beginning and 205.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 160.2 MB in the end (delta: -58.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.14 ms. Allocated memory is still 205.5 MB. Free memory was 160.2 MB in the beginning and 157.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 205.5 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.80 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 111.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68913.43 ms. Allocated memory was 205.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 110.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2015; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2016; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 68.6s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8803 SDtfs, 9600 SDslu, 21729 SDs, 0 SdLazy, 9239 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 101 SyntacticMatches, 23 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 129551 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2689 ConstructedInterpolants, 0 QuantifiedInterpolants, 519881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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 proved your program to be incorrect! Received shutdown request...