./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1d9124df5aff3d93132caeaebf2b71e0ed41a1f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 23:36:56,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 23:36:56,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 23:36:56,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 23:36:56,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 23:36:56,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 23:36:56,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 23:36:56,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 23:36:56,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 23:36:56,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 23:36:56,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 23:36:56,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 23:36:56,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 23:36:56,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 23:36:56,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 23:36:56,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 23:36:56,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 23:36:56,530 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 23:36:56,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 23:36:56,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 23:36:56,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 23:36:56,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 23:36:56,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 23:36:56,540 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 23:36:56,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 23:36:56,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 23:36:56,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 23:36:56,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 23:36:56,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 23:36:56,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 23:36:56,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 23:36:56,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 23:36:56,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 23:36:56,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 23:36:56,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 23:36:56,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 23:36:56,551 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 23:36:56,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 23:36:56,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 23:36:56,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 23:36:56,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 23:36:56,585 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 23:36:56,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 23:36:56,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 23:36:56,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 23:36:56,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 23:36:56,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 23:36:56,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 23:36:56,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 23:36:56,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 23:36:56,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 23:36:56,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 23:36:56,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 23:36:56,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 23:36:56,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 23:36:56,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 23:36:56,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 23:36:56,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 23:36:56,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 23:36:56,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 23:36:56,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1d9124df5aff3d93132caeaebf2b71e0ed41a1f [2018-12-31 23:36:56,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 23:36:56,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 23:36:56,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 23:36:56,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 23:36:56,689 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 23:36:56,690 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i [2018-12-31 23:36:56,755 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66ed597/e6ceb80e80934909ba5e894e4496004b/FLAG7ff0d4af9 [2018-12-31 23:36:57,375 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 23:36:57,376 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i [2018-12-31 23:36:57,399 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66ed597/e6ceb80e80934909ba5e894e4496004b/FLAG7ff0d4af9 [2018-12-31 23:36:57,563 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66ed597/e6ceb80e80934909ba5e894e4496004b [2018-12-31 23:36:57,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 23:36:57,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 23:36:57,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 23:36:57,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 23:36:57,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 23:36:57,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 11:36:57" (1/1) ... [2018-12-31 23:36:57,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:57, skipping insertion in model container [2018-12-31 23:36:57,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 11:36:57" (1/1) ... [2018-12-31 23:36:57,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 23:36:57,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 23:36:58,155 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 23:36:58,182 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 23:36:58,340 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 23:36:58,451 INFO L195 MainTranslator]: Completed translation [2018-12-31 23:36:58,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58 WrapperNode [2018-12-31 23:36:58,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 23:36:58,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 23:36:58,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 23:36:58,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 23:36:58,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 23:36:58,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 23:36:58,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 23:36:58,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 23:36:58,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (1/1) ... [2018-12-31 23:36:58,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 23:36:58,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 23:36:58,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 23:36:58,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 23:36:58,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (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 [2018-12-31 23:36:58,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 23:36:58,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 23:36:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 23:36:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 23:36:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 23:36:58,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 23:36:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 23:36:58,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 23:36:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 23:36:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 23:36:58,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 23:36:58,734 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 23:36:59,883 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 23:36:59,884 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 23:36:59,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:36:59 BoogieIcfgContainer [2018-12-31 23:36:59,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 23:36:59,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 23:36:59,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 23:36:59,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 23:36:59,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 11:36:57" (1/3) ... [2018-12-31 23:36:59,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 11:36:59, skipping insertion in model container [2018-12-31 23:36:59,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:36:58" (2/3) ... [2018-12-31 23:36:59,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 11:36:59, skipping insertion in model container [2018-12-31 23:36:59,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:36:59" (3/3) ... [2018-12-31 23:36:59,896 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.opt_false-unreach-call.i [2018-12-31 23:36:59,941 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,942 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,942 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,942 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,942 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,942 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,943 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,943 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,943 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,949 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,949 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,949 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,949 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,949 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,950 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,951 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,951 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:36:59,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 23:36:59,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 23:36:59,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 23:37:00,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 23:37:00,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 23:37:00,041 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 23:37:00,041 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 23:37:00,041 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 23:37:00,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 23:37:00,042 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 23:37:00,042 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 23:37:00,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 23:37:00,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 23:37:00,057 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-31 23:37:01,741 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2018-12-31 23:37:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2018-12-31 23:37:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 23:37:01,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:01,754 INFO L402 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] [2018-12-31 23:37:01,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2018-12-31 23:37:01,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:01,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:02,107 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2018-12-31 23:37:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:03,335 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2018-12-31 23:37:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 23:37:03,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-31 23:37:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:03,694 INFO L225 Difference]: With dead ends: 45395 [2018-12-31 23:37:03,694 INFO L226 Difference]: Without dead ends: 40635 [2018-12-31 23:37:03,697 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 [2018-12-31 23:37:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2018-12-31 23:37:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2018-12-31 23:37:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2018-12-31 23:37:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2018-12-31 23:37:05,595 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2018-12-31 23:37:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:05,600 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2018-12-31 23:37:05,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2018-12-31 23:37:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 23:37:05,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:05,620 INFO L402 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] [2018-12-31 23:37:05,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2018-12-31 23:37:05,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:05,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:05,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:05,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:05,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:05,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:05,988 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2018-12-31 23:37:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:09,298 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2018-12-31 23:37:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:37:09,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-31 23:37:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:09,641 INFO L225 Difference]: With dead ends: 64837 [2018-12-31 23:37:09,642 INFO L226 Difference]: Without dead ends: 64677 [2018-12-31 23:37:09,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2018-12-31 23:37:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2018-12-31 23:37:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2018-12-31 23:37:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2018-12-31 23:37:11,560 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2018-12-31 23:37:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:11,562 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2018-12-31 23:37:11,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2018-12-31 23:37:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 23:37:11,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:11,568 INFO L402 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] [2018-12-31 23:37:11,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2018-12-31 23:37:11,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:11,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:11,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:11,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:11,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:11,770 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2018-12-31 23:37:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:11,985 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2018-12-31 23:37:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:11,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-31 23:37:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:12,019 INFO L225 Difference]: With dead ends: 12371 [2018-12-31 23:37:12,019 INFO L226 Difference]: Without dead ends: 11850 [2018-12-31 23:37:12,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2018-12-31 23:37:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2018-12-31 23:37:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2018-12-31 23:37:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2018-12-31 23:37:12,302 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2018-12-31 23:37:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2018-12-31 23:37:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2018-12-31 23:37:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 23:37:12,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:12,309 INFO L402 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] [2018-12-31 23:37:12,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2018-12-31 23:37:12,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:12,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:12,626 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2018-12-31 23:37:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:13,413 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2018-12-31 23:37:13,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:13,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-31 23:37:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:13,456 INFO L225 Difference]: With dead ends: 17026 [2018-12-31 23:37:13,456 INFO L226 Difference]: Without dead ends: 17026 [2018-12-31 23:37:13,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2018-12-31 23:37:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2018-12-31 23:37:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2018-12-31 23:37:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2018-12-31 23:37:13,831 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2018-12-31 23:37:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:13,832 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2018-12-31 23:37:13,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2018-12-31 23:37:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 23:37:13,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:13,842 INFO L402 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] [2018-12-31 23:37:13,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2018-12-31 23:37:13,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:14,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:14,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:37:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:37:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:37:14,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:14,050 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 6 states. [2018-12-31 23:37:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:15,797 INFO L93 Difference]: Finished difference Result 18606 states and 60861 transitions. [2018-12-31 23:37:15,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 23:37:15,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-31 23:37:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:15,845 INFO L225 Difference]: With dead ends: 18606 [2018-12-31 23:37:15,845 INFO L226 Difference]: Without dead ends: 18574 [2018-12-31 23:37:15,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 23:37:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18574 states. [2018-12-31 23:37:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18574 to 14418. [2018-12-31 23:37:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2018-12-31 23:37:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 47580 transitions. [2018-12-31 23:37:16,131 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 47580 transitions. Word has length 57 [2018-12-31 23:37:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 14418 states and 47580 transitions. [2018-12-31 23:37:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:37:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 47580 transitions. [2018-12-31 23:37:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 23:37:16,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:16,160 INFO L402 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] [2018-12-31 23:37:16,161 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1122563706, now seen corresponding path program 1 times [2018-12-31 23:37:16,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:16,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:16,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:16,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:16,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:16,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:16,324 INFO L87 Difference]: Start difference. First operand 14418 states and 47580 transitions. Second operand 5 states. [2018-12-31 23:37:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:16,392 INFO L93 Difference]: Finished difference Result 2834 states and 7608 transitions. [2018-12-31 23:37:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 23:37:16,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-31 23:37:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:16,399 INFO L225 Difference]: With dead ends: 2834 [2018-12-31 23:37:16,399 INFO L226 Difference]: Without dead ends: 2422 [2018-12-31 23:37:16,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:37:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-12-31 23:37:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2319. [2018-12-31 23:37:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-12-31 23:37:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 6211 transitions. [2018-12-31 23:37:16,438 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 6211 transitions. Word has length 71 [2018-12-31 23:37:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:16,439 INFO L480 AbstractCegarLoop]: Abstraction has 2319 states and 6211 transitions. [2018-12-31 23:37:16,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 6211 transitions. [2018-12-31 23:37:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:37:16,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:16,448 INFO L402 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] [2018-12-31 23:37:16,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1246078848, now seen corresponding path program 1 times [2018-12-31 23:37:16,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:16,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:16,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:16,630 INFO L87 Difference]: Start difference. First operand 2319 states and 6211 transitions. Second operand 4 states. [2018-12-31 23:37:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:16,916 INFO L93 Difference]: Finished difference Result 3228 states and 8343 transitions. [2018-12-31 23:37:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:16,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-31 23:37:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:16,922 INFO L225 Difference]: With dead ends: 3228 [2018-12-31 23:37:16,922 INFO L226 Difference]: Without dead ends: 3228 [2018-12-31 23:37:16,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2018-12-31 23:37:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2754. [2018-12-31 23:37:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2018-12-31 23:37:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 7218 transitions. [2018-12-31 23:37:16,957 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 7218 transitions. Word has length 90 [2018-12-31 23:37:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:16,957 INFO L480 AbstractCegarLoop]: Abstraction has 2754 states and 7218 transitions. [2018-12-31 23:37:16,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 7218 transitions. [2018-12-31 23:37:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:37:16,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:16,963 INFO L402 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] [2018-12-31 23:37:16,964 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1865541151, now seen corresponding path program 1 times [2018-12-31 23:37:16,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:16,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:16,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:17,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:17,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:37:17,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:37:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:37:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:17,244 INFO L87 Difference]: Start difference. First operand 2754 states and 7218 transitions. Second operand 6 states. [2018-12-31 23:37:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:17,435 INFO L93 Difference]: Finished difference Result 2962 states and 7588 transitions. [2018-12-31 23:37:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 23:37:17,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-12-31 23:37:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:17,440 INFO L225 Difference]: With dead ends: 2962 [2018-12-31 23:37:17,441 INFO L226 Difference]: Without dead ends: 2962 [2018-12-31 23:37:17,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 23:37:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2018-12-31 23:37:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2732. [2018-12-31 23:37:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2018-12-31 23:37:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 7101 transitions. [2018-12-31 23:37:17,473 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 7101 transitions. Word has length 90 [2018-12-31 23:37:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:17,474 INFO L480 AbstractCegarLoop]: Abstraction has 2732 states and 7101 transitions. [2018-12-31 23:37:17,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:37:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 7101 transitions. [2018-12-31 23:37:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:37:17,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:17,480 INFO L402 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] [2018-12-31 23:37:17,480 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 840847230, now seen corresponding path program 1 times [2018-12-31 23:37:17,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:17,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:17,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:17,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:17,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:17,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:17,946 INFO L87 Difference]: Start difference. First operand 2732 states and 7101 transitions. Second operand 5 states. [2018-12-31 23:37:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:18,408 INFO L93 Difference]: Finished difference Result 3624 states and 9172 transitions. [2018-12-31 23:37:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:37:18,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-31 23:37:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:18,415 INFO L225 Difference]: With dead ends: 3624 [2018-12-31 23:37:18,415 INFO L226 Difference]: Without dead ends: 3624 [2018-12-31 23:37:18,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2018-12-31 23:37:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 2954. [2018-12-31 23:37:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2018-12-31 23:37:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 7597 transitions. [2018-12-31 23:37:18,455 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 7597 transitions. Word has length 90 [2018-12-31 23:37:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:18,455 INFO L480 AbstractCegarLoop]: Abstraction has 2954 states and 7597 transitions. [2018-12-31 23:37:18,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 7597 transitions. [2018-12-31 23:37:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:37:18,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:18,462 INFO L402 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] [2018-12-31 23:37:18,462 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1624800553, now seen corresponding path program 2 times [2018-12-31 23:37:18,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:18,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:18,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:18,670 INFO L87 Difference]: Start difference. First operand 2954 states and 7597 transitions. Second operand 4 states. [2018-12-31 23:37:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:19,023 INFO L93 Difference]: Finished difference Result 4362 states and 11252 transitions. [2018-12-31 23:37:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 23:37:19,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-31 23:37:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:19,030 INFO L225 Difference]: With dead ends: 4362 [2018-12-31 23:37:19,031 INFO L226 Difference]: Without dead ends: 4344 [2018-12-31 23:37:19,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2018-12-31 23:37:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 2996. [2018-12-31 23:37:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2018-12-31 23:37:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 7680 transitions. [2018-12-31 23:37:19,072 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 7680 transitions. Word has length 90 [2018-12-31 23:37:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:19,073 INFO L480 AbstractCegarLoop]: Abstraction has 2996 states and 7680 transitions. [2018-12-31 23:37:19,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 7680 transitions. [2018-12-31 23:37:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:37:19,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:19,078 INFO L402 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] [2018-12-31 23:37:19,078 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash 100591209, now seen corresponding path program 1 times [2018-12-31 23:37:19,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:19,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:19,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 23:37:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 23:37:19,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 23:37:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 23:37:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 23:37:19,201 INFO L87 Difference]: Start difference. First operand 2996 states and 7680 transitions. Second operand 3 states. [2018-12-31 23:37:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:19,654 INFO L93 Difference]: Finished difference Result 3048 states and 7779 transitions. [2018-12-31 23:37:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 23:37:19,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-31 23:37:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:19,660 INFO L225 Difference]: With dead ends: 3048 [2018-12-31 23:37:19,660 INFO L226 Difference]: Without dead ends: 3048 [2018-12-31 23:37:19,660 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 [2018-12-31 23:37:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2018-12-31 23:37:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3018. [2018-12-31 23:37:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-12-31 23:37:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7714 transitions. [2018-12-31 23:37:19,695 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7714 transitions. Word has length 90 [2018-12-31 23:37:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:19,695 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7714 transitions. [2018-12-31 23:37:19,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 23:37:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7714 transitions. [2018-12-31 23:37:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:19,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:19,701 INFO L402 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] [2018-12-31 23:37:19,701 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1619414373, now seen corresponding path program 1 times [2018-12-31 23:37:19,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:20,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:20,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 23:37:20,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 23:37:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 23:37:20,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 23:37:20,272 INFO L87 Difference]: Start difference. First operand 3018 states and 7714 transitions. Second operand 9 states. [2018-12-31 23:37:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:22,159 INFO L93 Difference]: Finished difference Result 7262 states and 18103 transitions. [2018-12-31 23:37:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 23:37:22,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-31 23:37:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:22,169 INFO L225 Difference]: With dead ends: 7262 [2018-12-31 23:37:22,169 INFO L226 Difference]: Without dead ends: 7198 [2018-12-31 23:37:22,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-31 23:37:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2018-12-31 23:37:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 4870. [2018-12-31 23:37:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2018-12-31 23:37:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 12383 transitions. [2018-12-31 23:37:22,246 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 12383 transitions. Word has length 92 [2018-12-31 23:37:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:22,246 INFO L480 AbstractCegarLoop]: Abstraction has 4870 states and 12383 transitions. [2018-12-31 23:37:22,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 23:37:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 12383 transitions. [2018-12-31 23:37:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:22,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:22,256 INFO L402 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] [2018-12-31 23:37:22,256 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1430788442, now seen corresponding path program 1 times [2018-12-31 23:37:22,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:22,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:22,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 23:37:22,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 23:37:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 23:37:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:37:22,579 INFO L87 Difference]: Start difference. First operand 4870 states and 12383 transitions. Second operand 7 states. [2018-12-31 23:37:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:23,293 INFO L93 Difference]: Finished difference Result 7871 states and 19820 transitions. [2018-12-31 23:37:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 23:37:23,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 23:37:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:23,306 INFO L225 Difference]: With dead ends: 7871 [2018-12-31 23:37:23,307 INFO L226 Difference]: Without dead ends: 7620 [2018-12-31 23:37:23,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:37:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2018-12-31 23:37:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 4956. [2018-12-31 23:37:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4956 states. [2018-12-31 23:37:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 12473 transitions. [2018-12-31 23:37:23,381 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 12473 transitions. Word has length 92 [2018-12-31 23:37:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 4956 states and 12473 transitions. [2018-12-31 23:37:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 23:37:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 12473 transitions. [2018-12-31 23:37:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:23,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:23,390 INFO L402 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] [2018-12-31 23:37:23,390 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1693857927, now seen corresponding path program 1 times [2018-12-31 23:37:23,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:23,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:23,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:23,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:23,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:23,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:37:23,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:37:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:37:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:23,591 INFO L87 Difference]: Start difference. First operand 4956 states and 12473 transitions. Second operand 6 states. [2018-12-31 23:37:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:23,946 INFO L93 Difference]: Finished difference Result 3745 states and 9545 transitions. [2018-12-31 23:37:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:37:23,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 23:37:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:23,955 INFO L225 Difference]: With dead ends: 3745 [2018-12-31 23:37:23,955 INFO L226 Difference]: Without dead ends: 3745 [2018-12-31 23:37:23,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2018-12-31 23:37:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3533. [2018-12-31 23:37:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3533 states. [2018-12-31 23:37:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 9082 transitions. [2018-12-31 23:37:24,017 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 9082 transitions. Word has length 92 [2018-12-31 23:37:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:24,017 INFO L480 AbstractCegarLoop]: Abstraction has 3533 states and 9082 transitions. [2018-12-31 23:37:24,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:37:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 9082 transitions. [2018-12-31 23:37:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:24,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:24,027 INFO L402 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] [2018-12-31 23:37:24,029 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:24,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2126124013, now seen corresponding path program 1 times [2018-12-31 23:37:24,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:24,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:24,891 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 23:37:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:25,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:25,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 23:37:25,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 23:37:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 23:37:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:25,005 INFO L87 Difference]: Start difference. First operand 3533 states and 9082 transitions. Second operand 8 states. [2018-12-31 23:37:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:25,616 INFO L93 Difference]: Finished difference Result 4558 states and 11583 transitions. [2018-12-31 23:37:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 23:37:25,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-31 23:37:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:25,623 INFO L225 Difference]: With dead ends: 4558 [2018-12-31 23:37:25,623 INFO L226 Difference]: Without dead ends: 4526 [2018-12-31 23:37:25,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-31 23:37:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2018-12-31 23:37:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3860. [2018-12-31 23:37:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2018-12-31 23:37:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 9869 transitions. [2018-12-31 23:37:25,676 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 9869 transitions. Word has length 92 [2018-12-31 23:37:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:25,676 INFO L480 AbstractCegarLoop]: Abstraction has 3860 states and 9869 transitions. [2018-12-31 23:37:25,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 23:37:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 9869 transitions. [2018-12-31 23:37:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:25,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:25,683 INFO L402 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] [2018-12-31 23:37:25,683 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1164509996, now seen corresponding path program 1 times [2018-12-31 23:37:25,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:25,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:25,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:25,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:25,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:25,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 23:37:25,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 23:37:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 23:37:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:37:25,910 INFO L87 Difference]: Start difference. First operand 3860 states and 9869 transitions. Second operand 7 states. [2018-12-31 23:37:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:26,346 INFO L93 Difference]: Finished difference Result 5143 states and 13041 transitions. [2018-12-31 23:37:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:37:26,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 23:37:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:26,354 INFO L225 Difference]: With dead ends: 5143 [2018-12-31 23:37:26,355 INFO L226 Difference]: Without dead ends: 5143 [2018-12-31 23:37:26,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:37:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5143 states. [2018-12-31 23:37:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5143 to 4228. [2018-12-31 23:37:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4228 states. [2018-12-31 23:37:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4228 states to 4228 states and 10855 transitions. [2018-12-31 23:37:26,410 INFO L78 Accepts]: Start accepts. Automaton has 4228 states and 10855 transitions. Word has length 92 [2018-12-31 23:37:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:26,411 INFO L480 AbstractCegarLoop]: Abstraction has 4228 states and 10855 transitions. [2018-12-31 23:37:26,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 23:37:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4228 states and 10855 transitions. [2018-12-31 23:37:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:26,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:26,421 INFO L402 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] [2018-12-31 23:37:26,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 80254485, now seen corresponding path program 1 times [2018-12-31 23:37:26,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:26,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:26,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:26,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:26,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:26,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:26,556 INFO L87 Difference]: Start difference. First operand 4228 states and 10855 transitions. Second operand 5 states. [2018-12-31 23:37:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:26,626 INFO L93 Difference]: Finished difference Result 6204 states and 16156 transitions. [2018-12-31 23:37:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:26,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-31 23:37:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:26,636 INFO L225 Difference]: With dead ends: 6204 [2018-12-31 23:37:26,636 INFO L226 Difference]: Without dead ends: 6204 [2018-12-31 23:37:26,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2018-12-31 23:37:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 3860. [2018-12-31 23:37:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2018-12-31 23:37:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 9782 transitions. [2018-12-31 23:37:26,689 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 9782 transitions. Word has length 92 [2018-12-31 23:37:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:26,689 INFO L480 AbstractCegarLoop]: Abstraction has 3860 states and 9782 transitions. [2018-12-31 23:37:26,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 9782 transitions. [2018-12-31 23:37:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:37:26,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:26,695 INFO L402 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] [2018-12-31 23:37:26,696 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash 560970901, now seen corresponding path program 1 times [2018-12-31 23:37:26,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:26,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:26,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:37:26,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:37:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:37:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:26,882 INFO L87 Difference]: Start difference. First operand 3860 states and 9782 transitions. Second operand 6 states. [2018-12-31 23:37:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:27,120 INFO L93 Difference]: Finished difference Result 3428 states and 8462 transitions. [2018-12-31 23:37:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:37:27,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 23:37:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:27,127 INFO L225 Difference]: With dead ends: 3428 [2018-12-31 23:37:27,127 INFO L226 Difference]: Without dead ends: 3428 [2018-12-31 23:37:27,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2018-12-31 23:37:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2619. [2018-12-31 23:37:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2018-12-31 23:37:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6636 transitions. [2018-12-31 23:37:27,161 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6636 transitions. Word has length 92 [2018-12-31 23:37:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:27,161 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6636 transitions. [2018-12-31 23:37:27,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:37:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6636 transitions. [2018-12-31 23:37:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:37:27,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:27,166 INFO L402 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] [2018-12-31 23:37:27,167 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2018-12-31 23:37:27,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:27,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:27,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:27,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:27,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:27,520 INFO L87 Difference]: Start difference. First operand 2619 states and 6636 transitions. Second operand 5 states. [2018-12-31 23:37:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:27,735 INFO L93 Difference]: Finished difference Result 2971 states and 7500 transitions. [2018-12-31 23:37:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:37:27,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 23:37:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:27,744 INFO L225 Difference]: With dead ends: 2971 [2018-12-31 23:37:27,745 INFO L226 Difference]: Without dead ends: 2939 [2018-12-31 23:37:27,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:37:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2018-12-31 23:37:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2667. [2018-12-31 23:37:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2018-12-31 23:37:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6740 transitions. [2018-12-31 23:37:27,776 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6740 transitions. Word has length 94 [2018-12-31 23:37:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:27,777 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 6740 transitions. [2018-12-31 23:37:27,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6740 transitions. [2018-12-31 23:37:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:37:27,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:27,782 INFO L402 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] [2018-12-31 23:37:27,782 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2018-12-31 23:37:27,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:27,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:27,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:27,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:27,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:28,076 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 23:37:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:37:29,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:29,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 23:37:29,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 23:37:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 23:37:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:37:29,173 INFO L87 Difference]: Start difference. First operand 2667 states and 6740 transitions. Second operand 12 states. [2018-12-31 23:37:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:30,033 INFO L93 Difference]: Finished difference Result 4454 states and 11424 transitions. [2018-12-31 23:37:30,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 23:37:30,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-31 23:37:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:30,040 INFO L225 Difference]: With dead ends: 4454 [2018-12-31 23:37:30,041 INFO L226 Difference]: Without dead ends: 3478 [2018-12-31 23:37:30,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 23:37:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2018-12-31 23:37:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3198. [2018-12-31 23:37:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2018-12-31 23:37:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7987 transitions. [2018-12-31 23:37:30,079 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7987 transitions. Word has length 94 [2018-12-31 23:37:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:30,080 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7987 transitions. [2018-12-31 23:37:30,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 23:37:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7987 transitions. [2018-12-31 23:37:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:37:30,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:30,085 INFO L402 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] [2018-12-31 23:37:30,086 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2018-12-31 23:37:30,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:30,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 23:37:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 23:37:30,187 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 23:37:30,397 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 23:37:30,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 11:37:30 BasicIcfg [2018-12-31 23:37:30,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 23:37:30,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 23:37:30,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 23:37:30,400 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 23:37:30,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:36:59" (3/4) ... [2018-12-31 23:37:30,407 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 23:37:30,604 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 23:37:30,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 23:37:30,606 INFO L168 Benchmark]: Toolchain (without parser) took 33038.24 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 950.0 MB in the beginning and 854.8 MB in the end (delta: 95.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,607 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 23:37:30,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,608 INFO L168 Benchmark]: Boogie Preprocessor took 92.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 23:37:30,609 INFO L168 Benchmark]: RCFGBuilder took 1227.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,611 INFO L168 Benchmark]: TraceAbstraction took 30511.15 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 882.5 MB in the end (delta: 170.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,611 INFO L168 Benchmark]: Witness Printer took 204.78 ms. Allocated memory is still 2.4 GB. Free memory was 882.5 MB in the beginning and 854.8 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-31 23:37:30,615 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 882.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1227.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30511.15 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 882.5 MB in the end (delta: 170.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 204.78 ms. Allocated memory is still 2.4 GB. Free memory was 882.5 MB in the beginning and 854.8 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _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] [L681] -1 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] [L682] -1 _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] [L683] -1 _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] [L684] -1 _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] [L685] -1 _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] [L686] -1 _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] [L687] -1 _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] [L688] -1 _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] [L689] -1 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}] [L690] -1 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] [L691] -1 _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] [L692] -1 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] [L693] -1 _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] [L694] -1 _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] [L695] -1 _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] [L755] -1 pthread_t t2013; 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] [L756] FCALL, FORK -1 pthread_create(&t2013, ((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] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L713] EXPR 0 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, 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] [L757] -1 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L758] FCALL, FORK -1 pthread_create(&t2014, ((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=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] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 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] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 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] [L733] EXPR 1 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] [L733] EXPR 1 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] EXPR 1 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_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] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 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_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] [L715] 0 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 [L716] EXPR 0 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_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] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 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_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] [L717] 0 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 [L720] 0 __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_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] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 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] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 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] [L735] 1 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 [L736] EXPR 1 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] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 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] [L737] 1 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 [L740] 1 __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] [L760] -1 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] [L764] EXPR -1 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] [L764] EXPR -1 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] [L764] EXPR -1 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] [L764] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L765] EXPR -1 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] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 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] [L766] -1 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 [L767] EXPR -1 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] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 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] [L768] -1 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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 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=1, 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] [L775] EXPR -1 !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=1, 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] [L775] -1 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) [L776] EXPR -1 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=1, 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] [L776] -1 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)) [L777] EXPR -1 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=1, 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] [L777] -1 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)) [L778] EXPR -1 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=1, 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] [L778] -1 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)) [L779] EXPR -1 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=1, 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] [L779] -1 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)) [L780] EXPR -1 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=1, 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] [L780] -1 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)) [L781] EXPR -1 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=1, 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] [L781] -1 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)) [L782] -1 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=1, 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] [L783] EXPR -1 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=1, 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] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 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=1, 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 -1 !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=1, 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] -1 __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=1, 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 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 30.3s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4551 SDtfs, 4494 SDslu, 11503 SDs, 0 SdLazy, 4498 SolverSat, 307 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 66135 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1566 ConstructedInterpolants, 0 QuantifiedInterpolants, 349800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...