./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix034_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/mix034_pso.oepc_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 733010b35f918d0990e31a17ab22e11c586e389b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-13 01:29:24,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:29:24,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:29:24,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:29:24,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:29:24,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:29:24,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:29:24,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:29:24,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:29:24,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:29:24,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:29:24,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:29:24,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:29:24,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:29:24,450 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:29:24,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:29:24,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:29:24,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:29:24,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:29:24,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:29:24,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:29:24,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:29:24,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:29:24,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:29:24,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:29:24,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:29:24,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:29:24,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:29:24,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:29:24,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:29:24,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:29:24,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:29:24,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:29:24,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:29:24,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:29:24,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:29:24,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:29:24,521 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:29:24,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:29:24,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:29:24,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:29:24,523 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:29:24,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:29:24,524 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:29:24,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:29:24,526 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:29:24,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:29:24,526 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:29:24,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:29:24,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:29:24,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:29:24,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:29:24,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:29:24,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:29:24,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:29:24,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:29:24,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:29:24,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:29:24,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:29:24,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:29:24,529 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 -> 733010b35f918d0990e31a17ab22e11c586e389b [2019-01-13 01:29:24,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:29:24,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:29:24,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:29:24,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:29:24,619 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:29:24,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix034_pso.oepc_false-unreach-call.i [2019-01-13 01:29:24,689 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4818f52b1/99d92e188f804a5e93dab6d102de1ab7/FLAG254c3baae [2019-01-13 01:29:25,252 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:29:25,255 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix034_pso.oepc_false-unreach-call.i [2019-01-13 01:29:25,271 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4818f52b1/99d92e188f804a5e93dab6d102de1ab7/FLAG254c3baae [2019-01-13 01:29:25,483 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4818f52b1/99d92e188f804a5e93dab6d102de1ab7 [2019-01-13 01:29:25,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:29:25,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:29:25,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:29:25,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:29:25,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:29:25,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:29:25" (1/1) ... [2019-01-13 01:29:25,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd106d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:25, skipping insertion in model container [2019-01-13 01:29:25,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:29:25" (1/1) ... [2019-01-13 01:29:25,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:29:25,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:29:26,069 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:29:26,097 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:29:26,260 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:29:26,333 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:29:26,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26 WrapperNode [2019-01-13 01:29:26,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:29:26,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:29:26,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:29:26,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:29:26,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:29:26,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:29:26,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:29:26,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:29:26,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... [2019-01-13 01:29:26,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:29:26,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:29:26,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:29:26,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:29:26,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:29:26,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:29:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:29:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:29:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:29:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:29:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:29:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:29:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:29:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:29:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:29:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:29:26,613 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 01:29:27,858 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:29:27,858 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:29:27,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:29:27 BoogieIcfgContainer [2019-01-13 01:29:27,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:29:27,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:29:27,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:29:27,865 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:29:27,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:29:25" (1/3) ... [2019-01-13 01:29:27,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dd8842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:29:27, skipping insertion in model container [2019-01-13 01:29:27,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:29:26" (2/3) ... [2019-01-13 01:29:27,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dd8842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:29:27, skipping insertion in model container [2019-01-13 01:29:27,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:29:27" (3/3) ... [2019-01-13 01:29:27,870 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc_false-unreach-call.i [2019-01-13 01:29:27,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,919 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,919 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,919 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,921 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,937 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,937 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:27,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:29:28,007 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:29:28,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:29:28,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:29:28,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:29:28,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:29:28,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:29:28,063 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:29:28,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:29:28,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:29:28,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:29:28,064 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:29:28,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:29:28,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:29:28,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 182 transitions [2019-01-13 01:29:31,193 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34808 states. [2019-01-13 01:29:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34808 states. [2019-01-13 01:29:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 01:29:31,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:31,206 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] [2019-01-13 01:29:31,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 998748630, now seen corresponding path program 1 times [2019-01-13 01:29:31,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:31,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:29:31,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:29:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:29:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:29:31,522 INFO L87 Difference]: Start difference. First operand 34808 states. Second operand 4 states. [2019-01-13 01:29:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:33,151 INFO L93 Difference]: Finished difference Result 60792 states and 234495 transitions. [2019-01-13 01:29:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:29:33,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 01:29:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:33,487 INFO L225 Difference]: With dead ends: 60792 [2019-01-13 01:29:33,487 INFO L226 Difference]: Without dead ends: 44272 [2019-01-13 01:29:33,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:29:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44272 states. [2019-01-13 01:29:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44272 to 27340. [2019-01-13 01:29:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27340 states. [2019-01-13 01:29:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 105501 transitions. [2019-01-13 01:29:35,404 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 105501 transitions. Word has length 35 [2019-01-13 01:29:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 27340 states and 105501 transitions. [2019-01-13 01:29:35,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:29:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 105501 transitions. [2019-01-13 01:29:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 01:29:35,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:35,428 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] [2019-01-13 01:29:35,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1553228635, now seen corresponding path program 1 times [2019-01-13 01:29:35,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:35,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:35,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:29:35,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:29:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:29:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:29:35,621 INFO L87 Difference]: Start difference. First operand 27340 states and 105501 transitions. Second operand 5 states. [2019-01-13 01:29:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:38,412 INFO L93 Difference]: Finished difference Result 64006 states and 235336 transitions. [2019-01-13 01:29:38,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:29:38,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 01:29:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:39,377 INFO L225 Difference]: With dead ends: 64006 [2019-01-13 01:29:39,378 INFO L226 Difference]: Without dead ends: 63454 [2019-01-13 01:29:39,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:29:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63454 states. [2019-01-13 01:29:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63454 to 41422. [2019-01-13 01:29:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41422 states. [2019-01-13 01:29:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41422 states to 41422 states and 152331 transitions. [2019-01-13 01:29:40,848 INFO L78 Accepts]: Start accepts. Automaton has 41422 states and 152331 transitions. Word has length 47 [2019-01-13 01:29:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:40,849 INFO L480 AbstractCegarLoop]: Abstraction has 41422 states and 152331 transitions. [2019-01-13 01:29:40,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:29:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41422 states and 152331 transitions. [2019-01-13 01:29:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 01:29:40,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:40,858 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] [2019-01-13 01:29:40,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -508045602, now seen corresponding path program 1 times [2019-01-13 01:29:40,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:40,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:40,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:41,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:41,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:29:41,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:29:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:29:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:29:41,035 INFO L87 Difference]: Start difference. First operand 41422 states and 152331 transitions. Second operand 5 states. [2019-01-13 01:29:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:42,575 INFO L93 Difference]: Finished difference Result 81368 states and 298049 transitions. [2019-01-13 01:29:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:29:42,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-13 01:29:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:42,788 INFO L225 Difference]: With dead ends: 81368 [2019-01-13 01:29:42,788 INFO L226 Difference]: Without dead ends: 80856 [2019-01-13 01:29:42,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:29:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80856 states. [2019-01-13 01:29:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80856 to 45376. [2019-01-13 01:29:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45376 states. [2019-01-13 01:29:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45376 states to 45376 states and 166019 transitions. [2019-01-13 01:29:45,007 INFO L78 Accepts]: Start accepts. Automaton has 45376 states and 166019 transitions. Word has length 48 [2019-01-13 01:29:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:45,008 INFO L480 AbstractCegarLoop]: Abstraction has 45376 states and 166019 transitions. [2019-01-13 01:29:45,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:29:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 45376 states and 166019 transitions. [2019-01-13 01:29:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 01:29:45,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:45,018 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] [2019-01-13 01:29:45,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1928335132, now seen corresponding path program 1 times [2019-01-13 01:29:45,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:45,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:45,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:45,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:45,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:29:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:29:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:29:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:29:45,099 INFO L87 Difference]: Start difference. First operand 45376 states and 166019 transitions. Second operand 3 states. [2019-01-13 01:29:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:45,440 INFO L93 Difference]: Finished difference Result 65252 states and 235815 transitions. [2019-01-13 01:29:45,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:29:45,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-13 01:29:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:45,602 INFO L225 Difference]: With dead ends: 65252 [2019-01-13 01:29:45,603 INFO L226 Difference]: Without dead ends: 65252 [2019-01-13 01:29:45,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:29:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65252 states. [2019-01-13 01:29:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65252 to 50946. [2019-01-13 01:29:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50946 states. [2019-01-13 01:29:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50946 states to 50946 states and 184326 transitions. [2019-01-13 01:29:47,955 INFO L78 Accepts]: Start accepts. Automaton has 50946 states and 184326 transitions. Word has length 50 [2019-01-13 01:29:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:47,955 INFO L480 AbstractCegarLoop]: Abstraction has 50946 states and 184326 transitions. [2019-01-13 01:29:47,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:29:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 50946 states and 184326 transitions. [2019-01-13 01:29:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 01:29:47,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:47,977 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] [2019-01-13 01:29:47,977 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -433775087, now seen corresponding path program 1 times [2019-01-13 01:29:47,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:47,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:48,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:48,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:29:48,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:29:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:29:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:29:48,339 INFO L87 Difference]: Start difference. First operand 50946 states and 184326 transitions. Second operand 6 states. [2019-01-13 01:29:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:49,600 INFO L93 Difference]: Finished difference Result 67512 states and 242186 transitions. [2019-01-13 01:29:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:29:49,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 01:29:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:49,775 INFO L225 Difference]: With dead ends: 67512 [2019-01-13 01:29:49,775 INFO L226 Difference]: Without dead ends: 67512 [2019-01-13 01:29:49,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:29:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67512 states. [2019-01-13 01:29:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67512 to 63437. [2019-01-13 01:29:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63437 states. [2019-01-13 01:29:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63437 states to 63437 states and 227585 transitions. [2019-01-13 01:29:52,147 INFO L78 Accepts]: Start accepts. Automaton has 63437 states and 227585 transitions. Word has length 54 [2019-01-13 01:29:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:52,148 INFO L480 AbstractCegarLoop]: Abstraction has 63437 states and 227585 transitions. [2019-01-13 01:29:52,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:29:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 63437 states and 227585 transitions. [2019-01-13 01:29:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 01:29:52,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:52,172 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] [2019-01-13 01:29:52,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2064240850, now seen corresponding path program 1 times [2019-01-13 01:29:52,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:52,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:52,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:52,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:29:52,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:29:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:29:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:29:52,836 INFO L87 Difference]: Start difference. First operand 63437 states and 227585 transitions. Second operand 7 states. [2019-01-13 01:29:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:54,626 INFO L93 Difference]: Finished difference Result 88529 states and 306202 transitions. [2019-01-13 01:29:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 01:29:54,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 01:29:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:54,847 INFO L225 Difference]: With dead ends: 88529 [2019-01-13 01:29:54,847 INFO L226 Difference]: Without dead ends: 88529 [2019-01-13 01:29:54,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:29:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88529 states. [2019-01-13 01:29:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88529 to 74882. [2019-01-13 01:29:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74882 states. [2019-01-13 01:29:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74882 states to 74882 states and 262988 transitions. [2019-01-13 01:29:56,467 INFO L78 Accepts]: Start accepts. Automaton has 74882 states and 262988 transitions. Word has length 54 [2019-01-13 01:29:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:56,467 INFO L480 AbstractCegarLoop]: Abstraction has 74882 states and 262988 transitions. [2019-01-13 01:29:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:29:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 74882 states and 262988 transitions. [2019-01-13 01:29:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 01:29:56,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:56,482 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] [2019-01-13 01:29:56,483 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1343222765, now seen corresponding path program 1 times [2019-01-13 01:29:56,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:56,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:56,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:29:56,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:29:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:29:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:29:56,660 INFO L87 Difference]: Start difference. First operand 74882 states and 262988 transitions. Second operand 4 states. [2019-01-13 01:29:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:56,821 INFO L93 Difference]: Finished difference Result 15376 states and 48827 transitions. [2019-01-13 01:29:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:29:56,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 01:29:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:56,846 INFO L225 Difference]: With dead ends: 15376 [2019-01-13 01:29:56,847 INFO L226 Difference]: Without dead ends: 13790 [2019-01-13 01:29:56,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:29:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13790 states. [2019-01-13 01:29:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13790 to 13741. [2019-01-13 01:29:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13741 states. [2019-01-13 01:29:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13741 states to 13741 states and 43353 transitions. [2019-01-13 01:29:57,055 INFO L78 Accepts]: Start accepts. Automaton has 13741 states and 43353 transitions. Word has length 54 [2019-01-13 01:29:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:57,055 INFO L480 AbstractCegarLoop]: Abstraction has 13741 states and 43353 transitions. [2019-01-13 01:29:57,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:29:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13741 states and 43353 transitions. [2019-01-13 01:29:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 01:29:57,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:57,057 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] [2019-01-13 01:29:57,058 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1510963439, now seen corresponding path program 1 times [2019-01-13 01:29:57,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:57,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:57,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:29:57,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:29:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:29:57,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:29:57,238 INFO L87 Difference]: Start difference. First operand 13741 states and 43353 transitions. Second operand 7 states. [2019-01-13 01:29:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:58,150 INFO L93 Difference]: Finished difference Result 17069 states and 53149 transitions. [2019-01-13 01:29:58,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 01:29:58,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 01:29:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:58,180 INFO L225 Difference]: With dead ends: 17069 [2019-01-13 01:29:58,180 INFO L226 Difference]: Without dead ends: 16997 [2019-01-13 01:29:58,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 01:29:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16997 states. [2019-01-13 01:29:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16997 to 14315. [2019-01-13 01:29:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14315 states. [2019-01-13 01:29:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 45050 transitions. [2019-01-13 01:29:58,405 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 45050 transitions. Word has length 54 [2019-01-13 01:29:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:58,405 INFO L480 AbstractCegarLoop]: Abstraction has 14315 states and 45050 transitions. [2019-01-13 01:29:58,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:29:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 45050 transitions. [2019-01-13 01:29:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 01:29:58,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:58,410 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] [2019-01-13 01:29:58,410 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 516780875, now seen corresponding path program 1 times [2019-01-13 01:29:58,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:58,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:58,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:29:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:29:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:29:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:29:58,620 INFO L87 Difference]: Start difference. First operand 14315 states and 45050 transitions. Second operand 4 states. [2019-01-13 01:29:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:29:58,822 INFO L93 Difference]: Finished difference Result 16618 states and 52378 transitions. [2019-01-13 01:29:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:29:58,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-13 01:29:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:29:58,862 INFO L225 Difference]: With dead ends: 16618 [2019-01-13 01:29:58,863 INFO L226 Difference]: Without dead ends: 16618 [2019-01-13 01:29:58,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:29:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2019-01-13 01:29:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 15135. [2019-01-13 01:29:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2019-01-13 01:29:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 47640 transitions. [2019-01-13 01:29:59,094 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 47640 transitions. Word has length 62 [2019-01-13 01:29:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:29:59,094 INFO L480 AbstractCegarLoop]: Abstraction has 15135 states and 47640 transitions. [2019-01-13 01:29:59,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:29:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 47640 transitions. [2019-01-13 01:29:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 01:29:59,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:29:59,100 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] [2019-01-13 01:29:59,100 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:29:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:29:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2035376086, now seen corresponding path program 1 times [2019-01-13 01:29:59,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:29:59,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:29:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:59,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:29:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:29:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:29:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:29:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:29:59,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:29:59,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:29:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:29:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:29:59,516 INFO L87 Difference]: Start difference. First operand 15135 states and 47640 transitions. Second operand 6 states. [2019-01-13 01:30:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:00,181 INFO L93 Difference]: Finished difference Result 28107 states and 88148 transitions. [2019-01-13 01:30:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:30:00,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-13 01:30:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:00,231 INFO L225 Difference]: With dead ends: 28107 [2019-01-13 01:30:00,232 INFO L226 Difference]: Without dead ends: 28036 [2019-01-13 01:30:00,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 01:30:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28036 states. [2019-01-13 01:30:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28036 to 17413. [2019-01-13 01:30:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2019-01-13 01:30:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 54314 transitions. [2019-01-13 01:30:00,555 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 54314 transitions. Word has length 62 [2019-01-13 01:30:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:00,555 INFO L480 AbstractCegarLoop]: Abstraction has 17413 states and 54314 transitions. [2019-01-13 01:30:00,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:30:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 54314 transitions. [2019-01-13 01:30:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 01:30:00,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:00,562 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] [2019-01-13 01:30:00,563 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 505162303, now seen corresponding path program 1 times [2019-01-13 01:30:00,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:00,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:30:00,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:30:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:30:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:30:00,693 INFO L87 Difference]: Start difference. First operand 17413 states and 54314 transitions. Second operand 4 states. [2019-01-13 01:30:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:01,365 INFO L93 Difference]: Finished difference Result 21357 states and 65803 transitions. [2019-01-13 01:30:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:30:01,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 01:30:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:01,402 INFO L225 Difference]: With dead ends: 21357 [2019-01-13 01:30:01,402 INFO L226 Difference]: Without dead ends: 21357 [2019-01-13 01:30:01,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:30:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21357 states. [2019-01-13 01:30:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21357 to 19307. [2019-01-13 01:30:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19307 states. [2019-01-13 01:30:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19307 states to 19307 states and 59693 transitions. [2019-01-13 01:30:01,691 INFO L78 Accepts]: Start accepts. Automaton has 19307 states and 59693 transitions. Word has length 66 [2019-01-13 01:30:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 19307 states and 59693 transitions. [2019-01-13 01:30:01,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:30:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19307 states and 59693 transitions. [2019-01-13 01:30:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 01:30:01,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:01,700 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] [2019-01-13 01:30:01,700 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 250425758, now seen corresponding path program 1 times [2019-01-13 01:30:01,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:01,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:01,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:01,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:01,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:01,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:30:01,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:30:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:30:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:30:01,825 INFO L87 Difference]: Start difference. First operand 19307 states and 59693 transitions. Second operand 3 states. [2019-01-13 01:30:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:02,141 INFO L93 Difference]: Finished difference Result 19947 states and 61432 transitions. [2019-01-13 01:30:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:30:02,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 01:30:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:02,176 INFO L225 Difference]: With dead ends: 19947 [2019-01-13 01:30:02,176 INFO L226 Difference]: Without dead ends: 19947 [2019-01-13 01:30:02,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:30:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2019-01-13 01:30:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 19647. [2019-01-13 01:30:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19647 states. [2019-01-13 01:30:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19647 states to 19647 states and 60609 transitions. [2019-01-13 01:30:02,461 INFO L78 Accepts]: Start accepts. Automaton has 19647 states and 60609 transitions. Word has length 66 [2019-01-13 01:30:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:02,462 INFO L480 AbstractCegarLoop]: Abstraction has 19647 states and 60609 transitions. [2019-01-13 01:30:02,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:30:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19647 states and 60609 transitions. [2019-01-13 01:30:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:02,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:02,472 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] [2019-01-13 01:30:02,473 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:02,473 INFO L82 PathProgramCache]: Analyzing trace with hash -356405788, now seen corresponding path program 1 times [2019-01-13 01:30:02,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:02,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:02,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:02,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:30:02,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:30:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:30:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:30:02,656 INFO L87 Difference]: Start difference. First operand 19647 states and 60609 transitions. Second operand 6 states. [2019-01-13 01:30:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:04,043 INFO L93 Difference]: Finished difference Result 23815 states and 72327 transitions. [2019-01-13 01:30:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:30:04,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 01:30:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:04,083 INFO L225 Difference]: With dead ends: 23815 [2019-01-13 01:30:04,083 INFO L226 Difference]: Without dead ends: 23815 [2019-01-13 01:30:04,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23815 states. [2019-01-13 01:30:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23815 to 22475. [2019-01-13 01:30:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22475 states. [2019-01-13 01:30:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22475 states to 22475 states and 68749 transitions. [2019-01-13 01:30:04,570 INFO L78 Accepts]: Start accepts. Automaton has 22475 states and 68749 transitions. Word has length 68 [2019-01-13 01:30:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:04,570 INFO L480 AbstractCegarLoop]: Abstraction has 22475 states and 68749 transitions. [2019-01-13 01:30:04,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:30:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 22475 states and 68749 transitions. [2019-01-13 01:30:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:04,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:04,582 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] [2019-01-13 01:30:04,582 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash -611142333, now seen corresponding path program 1 times [2019-01-13 01:30:04,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:04,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:04,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:04,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:04,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:04,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:04,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:30:04,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:30:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:30:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:30:04,830 INFO L87 Difference]: Start difference. First operand 22475 states and 68749 transitions. Second operand 6 states. [2019-01-13 01:30:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:05,424 INFO L93 Difference]: Finished difference Result 25703 states and 76209 transitions. [2019-01-13 01:30:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:30:05,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 01:30:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:05,467 INFO L225 Difference]: With dead ends: 25703 [2019-01-13 01:30:05,467 INFO L226 Difference]: Without dead ends: 25703 [2019-01-13 01:30:05,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:30:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-01-13 01:30:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 22859. [2019-01-13 01:30:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22859 states. [2019-01-13 01:30:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22859 states to 22859 states and 68855 transitions. [2019-01-13 01:30:05,807 INFO L78 Accepts]: Start accepts. Automaton has 22859 states and 68855 transitions. Word has length 68 [2019-01-13 01:30:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:05,807 INFO L480 AbstractCegarLoop]: Abstraction has 22859 states and 68855 transitions. [2019-01-13 01:30:05,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:30:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22859 states and 68855 transitions. [2019-01-13 01:30:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:05,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:05,820 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] [2019-01-13 01:30:05,820 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash -678149086, now seen corresponding path program 1 times [2019-01-13 01:30:05,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:05,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:05,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:05,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:05,961 INFO L87 Difference]: Start difference. First operand 22859 states and 68855 transitions. Second operand 5 states. [2019-01-13 01:30:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:06,473 INFO L93 Difference]: Finished difference Result 29794 states and 89420 transitions. [2019-01-13 01:30:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:30:06,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 01:30:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:06,541 INFO L225 Difference]: With dead ends: 29794 [2019-01-13 01:30:06,541 INFO L226 Difference]: Without dead ends: 29794 [2019-01-13 01:30:06,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29794 states. [2019-01-13 01:30:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29794 to 26815. [2019-01-13 01:30:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26815 states. [2019-01-13 01:30:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26815 states to 26815 states and 80364 transitions. [2019-01-13 01:30:06,946 INFO L78 Accepts]: Start accepts. Automaton has 26815 states and 80364 transitions. Word has length 68 [2019-01-13 01:30:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:06,947 INFO L480 AbstractCegarLoop]: Abstraction has 26815 states and 80364 transitions. [2019-01-13 01:30:06,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26815 states and 80364 transitions. [2019-01-13 01:30:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:06,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:06,962 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] [2019-01-13 01:30:06,962 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1188683263, now seen corresponding path program 1 times [2019-01-13 01:30:06,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:06,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:06,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:07,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:07,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:07,124 INFO L87 Difference]: Start difference. First operand 26815 states and 80364 transitions. Second operand 5 states. [2019-01-13 01:30:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:07,849 INFO L93 Difference]: Finished difference Result 36421 states and 108434 transitions. [2019-01-13 01:30:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:30:07,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 01:30:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:07,911 INFO L225 Difference]: With dead ends: 36421 [2019-01-13 01:30:07,911 INFO L226 Difference]: Without dead ends: 36421 [2019-01-13 01:30:07,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:30:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2019-01-13 01:30:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 29429. [2019-01-13 01:30:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29429 states. [2019-01-13 01:30:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29429 states to 29429 states and 87840 transitions. [2019-01-13 01:30:08,395 INFO L78 Accepts]: Start accepts. Automaton has 29429 states and 87840 transitions. Word has length 68 [2019-01-13 01:30:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:08,395 INFO L480 AbstractCegarLoop]: Abstraction has 29429 states and 87840 transitions. [2019-01-13 01:30:08,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29429 states and 87840 transitions. [2019-01-13 01:30:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:08,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:08,406 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] [2019-01-13 01:30:08,407 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1298829570, now seen corresponding path program 1 times [2019-01-13 01:30:08,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:08,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:08,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:08,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:08,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:08,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:30:08,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:30:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:30:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:30:08,639 INFO L87 Difference]: Start difference. First operand 29429 states and 87840 transitions. Second operand 6 states. [2019-01-13 01:30:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:08,863 INFO L93 Difference]: Finished difference Result 28041 states and 79299 transitions. [2019-01-13 01:30:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:30:08,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 01:30:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:08,907 INFO L225 Difference]: With dead ends: 28041 [2019-01-13 01:30:08,907 INFO L226 Difference]: Without dead ends: 28041 [2019-01-13 01:30:08,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28041 states. [2019-01-13 01:30:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28041 to 23993. [2019-01-13 01:30:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23993 states. [2019-01-13 01:30:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23993 states to 23993 states and 68156 transitions. [2019-01-13 01:30:09,257 INFO L78 Accepts]: Start accepts. Automaton has 23993 states and 68156 transitions. Word has length 68 [2019-01-13 01:30:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:09,257 INFO L480 AbstractCegarLoop]: Abstraction has 23993 states and 68156 transitions. [2019-01-13 01:30:09,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:30:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23993 states and 68156 transitions. [2019-01-13 01:30:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:09,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:09,266 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] [2019-01-13 01:30:09,267 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 389381892, now seen corresponding path program 1 times [2019-01-13 01:30:09,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:09,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:09,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:09,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:09,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:09,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:09,523 INFO L87 Difference]: Start difference. First operand 23993 states and 68156 transitions. Second operand 5 states. [2019-01-13 01:30:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:09,587 INFO L93 Difference]: Finished difference Result 7181 states and 17283 transitions. [2019-01-13 01:30:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:30:09,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 01:30:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:09,595 INFO L225 Difference]: With dead ends: 7181 [2019-01-13 01:30:09,596 INFO L226 Difference]: Without dead ends: 5896 [2019-01-13 01:30:09,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2019-01-13 01:30:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5236. [2019-01-13 01:30:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2019-01-13 01:30:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 12141 transitions. [2019-01-13 01:30:09,653 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 12141 transitions. Word has length 68 [2019-01-13 01:30:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 5236 states and 12141 transitions. [2019-01-13 01:30:09,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 12141 transitions. [2019-01-13 01:30:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:30:09,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:09,659 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] [2019-01-13 01:30:09,660 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -342568837, now seen corresponding path program 1 times [2019-01-13 01:30:09,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:09,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:09,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:09,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:09,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:09,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:09,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:30:09,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:30:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:30:09,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:30:09,734 INFO L87 Difference]: Start difference. First operand 5236 states and 12141 transitions. Second operand 3 states. [2019-01-13 01:30:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:09,975 INFO L93 Difference]: Finished difference Result 6577 states and 15019 transitions. [2019-01-13 01:30:09,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:30:09,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-13 01:30:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:09,983 INFO L225 Difference]: With dead ends: 6577 [2019-01-13 01:30:09,983 INFO L226 Difference]: Without dead ends: 6577 [2019-01-13 01:30:09,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:30:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2019-01-13 01:30:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 5175. [2019-01-13 01:30:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2019-01-13 01:30:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 11681 transitions. [2019-01-13 01:30:10,055 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 11681 transitions. Word has length 68 [2019-01-13 01:30:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:10,056 INFO L480 AbstractCegarLoop]: Abstraction has 5175 states and 11681 transitions. [2019-01-13 01:30:10,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:30:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 11681 transitions. [2019-01-13 01:30:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-13 01:30:10,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:10,063 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] [2019-01-13 01:30:10,064 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash -571353426, now seen corresponding path program 1 times [2019-01-13 01:30:10,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:10,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:10,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:10,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:10,413 INFO L87 Difference]: Start difference. First operand 5175 states and 11681 transitions. Second operand 5 states. [2019-01-13 01:30:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:11,491 INFO L93 Difference]: Finished difference Result 6325 states and 14274 transitions. [2019-01-13 01:30:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:30:11,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-13 01:30:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:11,501 INFO L225 Difference]: With dead ends: 6325 [2019-01-13 01:30:11,501 INFO L226 Difference]: Without dead ends: 6325 [2019-01-13 01:30:11,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:30:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2019-01-13 01:30:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 5619. [2019-01-13 01:30:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2019-01-13 01:30:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 12685 transitions. [2019-01-13 01:30:11,579 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 12685 transitions. Word has length 74 [2019-01-13 01:30:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:11,579 INFO L480 AbstractCegarLoop]: Abstraction has 5619 states and 12685 transitions. [2019-01-13 01:30:11,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 12685 transitions. [2019-01-13 01:30:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-13 01:30:11,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:11,586 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] [2019-01-13 01:30:11,586 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1171456909, now seen corresponding path program 1 times [2019-01-13 01:30:11,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:11,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:30:11,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:30:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:30:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:11,923 INFO L87 Difference]: Start difference. First operand 5619 states and 12685 transitions. Second operand 7 states. [2019-01-13 01:30:12,462 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-13 01:30:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:13,558 INFO L93 Difference]: Finished difference Result 6586 states and 14710 transitions. [2019-01-13 01:30:13,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:30:13,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-01-13 01:30:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:13,568 INFO L225 Difference]: With dead ends: 6586 [2019-01-13 01:30:13,569 INFO L226 Difference]: Without dead ends: 6484 [2019-01-13 01:30:13,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 01:30:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-01-13 01:30:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5716. [2019-01-13 01:30:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2019-01-13 01:30:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12778 transitions. [2019-01-13 01:30:13,649 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12778 transitions. Word has length 74 [2019-01-13 01:30:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:13,650 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12778 transitions. [2019-01-13 01:30:13,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:30:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12778 transitions. [2019-01-13 01:30:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:30:13,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:13,658 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, 1] [2019-01-13 01:30:13,659 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2144466605, now seen corresponding path program 1 times [2019-01-13 01:30:13,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:13,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:13,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:30:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:30:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:30:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:13,917 INFO L87 Difference]: Start difference. First operand 5716 states and 12778 transitions. Second operand 7 states. [2019-01-13 01:30:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:14,732 INFO L93 Difference]: Finished difference Result 7199 states and 16113 transitions. [2019-01-13 01:30:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:30:14,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 01:30:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:14,744 INFO L225 Difference]: With dead ends: 7199 [2019-01-13 01:30:14,744 INFO L226 Difference]: Without dead ends: 7199 [2019-01-13 01:30:14,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2019-01-13 01:30:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 5856. [2019-01-13 01:30:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2019-01-13 01:30:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 13166 transitions. [2019-01-13 01:30:14,813 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 13166 transitions. Word has length 95 [2019-01-13 01:30:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:14,813 INFO L480 AbstractCegarLoop]: Abstraction has 5856 states and 13166 transitions. [2019-01-13 01:30:14,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:30:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 13166 transitions. [2019-01-13 01:30:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:30:14,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:14,822 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, 1] [2019-01-13 01:30:14,823 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1598659536, now seen corresponding path program 1 times [2019-01-13 01:30:14,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:14,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:14,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:14,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:14,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:15,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:15,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:30:15,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:30:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:30:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:30:15,009 INFO L87 Difference]: Start difference. First operand 5856 states and 13166 transitions. Second operand 4 states. [2019-01-13 01:30:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:15,127 INFO L93 Difference]: Finished difference Result 6980 states and 15568 transitions. [2019-01-13 01:30:15,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:30:15,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 01:30:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:15,136 INFO L225 Difference]: With dead ends: 6980 [2019-01-13 01:30:15,137 INFO L226 Difference]: Without dead ends: 6980 [2019-01-13 01:30:15,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2019-01-13 01:30:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6213. [2019-01-13 01:30:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2019-01-13 01:30:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 13936 transitions. [2019-01-13 01:30:15,208 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 13936 transitions. Word has length 95 [2019-01-13 01:30:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:15,208 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 13936 transitions. [2019-01-13 01:30:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:30:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 13936 transitions. [2019-01-13 01:30:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:15,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:15,217 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, 1, 1, 1] [2019-01-13 01:30:15,217 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:15,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1803412790, now seen corresponding path program 1 times [2019-01-13 01:30:15,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:15,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:15,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:15,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:15,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:15,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:15,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:15,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:15,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:15,398 INFO L87 Difference]: Start difference. First operand 6213 states and 13936 transitions. Second operand 5 states. [2019-01-13 01:30:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:15,554 INFO L93 Difference]: Finished difference Result 6659 states and 14882 transitions. [2019-01-13 01:30:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:30:15,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:30:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:15,562 INFO L225 Difference]: With dead ends: 6659 [2019-01-13 01:30:15,563 INFO L226 Difference]: Without dead ends: 6659 [2019-01-13 01:30:15,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-01-13 01:30:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5109. [2019-01-13 01:30:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2019-01-13 01:30:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 11452 transitions. [2019-01-13 01:30:15,625 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 11452 transitions. Word has length 97 [2019-01-13 01:30:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:15,626 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 11452 transitions. [2019-01-13 01:30:15,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 11452 transitions. [2019-01-13 01:30:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:15,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:15,632 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, 1, 1, 1] [2019-01-13 01:30:15,632 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1814728917, now seen corresponding path program 1 times [2019-01-13 01:30:15,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:15,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:15,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:30:15,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:30:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:30:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:30:15,897 INFO L87 Difference]: Start difference. First operand 5109 states and 11452 transitions. Second operand 4 states. [2019-01-13 01:30:16,859 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:30:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:17,450 INFO L93 Difference]: Finished difference Result 6613 states and 14743 transitions. [2019-01-13 01:30:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:30:17,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-13 01:30:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:17,460 INFO L225 Difference]: With dead ends: 6613 [2019-01-13 01:30:17,461 INFO L226 Difference]: Without dead ends: 6566 [2019-01-13 01:30:17,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2019-01-13 01:30:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 6157. [2019-01-13 01:30:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6157 states. [2019-01-13 01:30:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 13768 transitions. [2019-01-13 01:30:17,530 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 13768 transitions. Word has length 97 [2019-01-13 01:30:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:17,530 INFO L480 AbstractCegarLoop]: Abstraction has 6157 states and 13768 transitions. [2019-01-13 01:30:17,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:30:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 13768 transitions. [2019-01-13 01:30:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:17,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:17,537 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, 1, 1, 1] [2019-01-13 01:30:17,538 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash -262480426, now seen corresponding path program 1 times [2019-01-13 01:30:17,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:17,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:17,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:17,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:17,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:17,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:30:17,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:30:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:30:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:30:17,778 INFO L87 Difference]: Start difference. First operand 6157 states and 13768 transitions. Second operand 9 states. [2019-01-13 01:30:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:18,601 INFO L93 Difference]: Finished difference Result 7878 states and 17405 transitions. [2019-01-13 01:30:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 01:30:18,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-01-13 01:30:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:18,612 INFO L225 Difference]: With dead ends: 7878 [2019-01-13 01:30:18,613 INFO L226 Difference]: Without dead ends: 7878 [2019-01-13 01:30:18,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-01-13 01:30:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2019-01-13 01:30:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 6683. [2019-01-13 01:30:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-01-13 01:30:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 14838 transitions. [2019-01-13 01:30:18,690 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 14838 transitions. Word has length 97 [2019-01-13 01:30:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:18,690 INFO L480 AbstractCegarLoop]: Abstraction has 6683 states and 14838 transitions. [2019-01-13 01:30:18,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:30:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 14838 transitions. [2019-01-13 01:30:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:18,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:18,697 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, 1, 1, 1] [2019-01-13 01:30:18,698 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash -51129513, now seen corresponding path program 1 times [2019-01-13 01:30:18,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:18,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:18,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:30:18,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:30:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:30:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:30:18,938 INFO L87 Difference]: Start difference. First operand 6683 states and 14838 transitions. Second operand 11 states. [2019-01-13 01:30:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:20,706 INFO L93 Difference]: Finished difference Result 12276 states and 27352 transitions. [2019-01-13 01:30:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 01:30:20,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-01-13 01:30:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:20,718 INFO L225 Difference]: With dead ends: 12276 [2019-01-13 01:30:20,719 INFO L226 Difference]: Without dead ends: 8479 [2019-01-13 01:30:20,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 01:30:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2019-01-13 01:30:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 6439. [2019-01-13 01:30:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6439 states. [2019-01-13 01:30:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 14285 transitions. [2019-01-13 01:30:20,798 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 14285 transitions. Word has length 97 [2019-01-13 01:30:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:20,798 INFO L480 AbstractCegarLoop]: Abstraction has 6439 states and 14285 transitions. [2019-01-13 01:30:20,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:30:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 14285 transitions. [2019-01-13 01:30:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:20,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:20,805 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, 1, 1, 1] [2019-01-13 01:30:20,805 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash 746604445, now seen corresponding path program 1 times [2019-01-13 01:30:20,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:20,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:20,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:20,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:21,229 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:30:21,722 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 01:30:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:21,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:21,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:30:21,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:30:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:30:21,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:30:21,761 INFO L87 Difference]: Start difference. First operand 6439 states and 14285 transitions. Second operand 6 states. [2019-01-13 01:30:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:22,344 INFO L93 Difference]: Finished difference Result 7393 states and 16150 transitions. [2019-01-13 01:30:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:30:22,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-01-13 01:30:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:22,354 INFO L225 Difference]: With dead ends: 7393 [2019-01-13 01:30:22,355 INFO L226 Difference]: Without dead ends: 7362 [2019-01-13 01:30:22,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2019-01-13 01:30:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 6492. [2019-01-13 01:30:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6492 states. [2019-01-13 01:30:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 14216 transitions. [2019-01-13 01:30:22,428 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 14216 transitions. Word has length 97 [2019-01-13 01:30:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:22,429 INFO L480 AbstractCegarLoop]: Abstraction has 6492 states and 14216 transitions. [2019-01-13 01:30:22,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:30:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 14216 transitions. [2019-01-13 01:30:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:22,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:22,436 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, 1, 1, 1] [2019-01-13 01:30:22,436 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -439969543, now seen corresponding path program 1 times [2019-01-13 01:30:22,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:22,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:30:22,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:30:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:30:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:30:22,608 INFO L87 Difference]: Start difference. First operand 6492 states and 14216 transitions. Second operand 5 states. [2019-01-13 01:30:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:22,868 INFO L93 Difference]: Finished difference Result 7692 states and 16739 transitions. [2019-01-13 01:30:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:30:22,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:30:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:22,879 INFO L225 Difference]: With dead ends: 7692 [2019-01-13 01:30:22,880 INFO L226 Difference]: Without dead ends: 7605 [2019-01-13 01:30:22,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:30:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2019-01-13 01:30:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6147. [2019-01-13 01:30:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2019-01-13 01:30:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 13534 transitions. [2019-01-13 01:30:22,956 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 13534 transitions. Word has length 97 [2019-01-13 01:30:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:22,956 INFO L480 AbstractCegarLoop]: Abstraction has 6147 states and 13534 transitions. [2019-01-13 01:30:22,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:30:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 13534 transitions. [2019-01-13 01:30:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:22,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:22,964 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, 1, 1, 1] [2019-01-13 01:30:22,964 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1423115111, now seen corresponding path program 2 times [2019-01-13 01:30:22,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:23,449 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:30:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:30:23,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:30:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:30:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:30:23,573 INFO L87 Difference]: Start difference. First operand 6147 states and 13534 transitions. Second operand 9 states. [2019-01-13 01:30:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:24,407 INFO L93 Difference]: Finished difference Result 6889 states and 15104 transitions. [2019-01-13 01:30:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:30:24,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-01-13 01:30:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:24,417 INFO L225 Difference]: With dead ends: 6889 [2019-01-13 01:30:24,417 INFO L226 Difference]: Without dead ends: 6882 [2019-01-13 01:30:24,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:30:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2019-01-13 01:30:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6286. [2019-01-13 01:30:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6286 states. [2019-01-13 01:30:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 13832 transitions. [2019-01-13 01:30:24,486 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 13832 transitions. Word has length 97 [2019-01-13 01:30:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:24,487 INFO L480 AbstractCegarLoop]: Abstraction has 6286 states and 13832 transitions. [2019-01-13 01:30:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:30:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 13832 transitions. [2019-01-13 01:30:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:24,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:24,494 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, 1, 1, 1] [2019-01-13 01:30:24,494 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1211764198, now seen corresponding path program 1 times [2019-01-13 01:30:24,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:24,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:24,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:30:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:24,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:30:24,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:30:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:30:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:30:24,718 INFO L87 Difference]: Start difference. First operand 6286 states and 13832 transitions. Second operand 7 states. [2019-01-13 01:30:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:25,087 INFO L93 Difference]: Finished difference Result 8076 states and 17595 transitions. [2019-01-13 01:30:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:30:25,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-01-13 01:30:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:25,099 INFO L225 Difference]: With dead ends: 8076 [2019-01-13 01:30:25,099 INFO L226 Difference]: Without dead ends: 8076 [2019-01-13 01:30:25,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:30:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2019-01-13 01:30:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 6350. [2019-01-13 01:30:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2019-01-13 01:30:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 13979 transitions. [2019-01-13 01:30:25,178 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 13979 transitions. Word has length 97 [2019-01-13 01:30:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:25,178 INFO L480 AbstractCegarLoop]: Abstraction has 6350 states and 13979 transitions. [2019-01-13 01:30:25,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:30:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 13979 transitions. [2019-01-13 01:30:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:25,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:25,190 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, 1, 1, 1] [2019-01-13 01:30:25,192 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1915558852, now seen corresponding path program 2 times [2019-01-13 01:30:25,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:25,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:30:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:30:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:30:25,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:30:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:30:25,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:30:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:30:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:30:25,407 INFO L87 Difference]: Start difference. First operand 6350 states and 13979 transitions. Second operand 8 states. [2019-01-13 01:30:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:30:25,915 INFO L93 Difference]: Finished difference Result 8172 states and 17759 transitions. [2019-01-13 01:30:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:30:25,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-01-13 01:30:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:30:25,927 INFO L225 Difference]: With dead ends: 8172 [2019-01-13 01:30:25,927 INFO L226 Difference]: Without dead ends: 8172 [2019-01-13 01:30:25,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-01-13 01:30:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2019-01-13 01:30:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 6484. [2019-01-13 01:30:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2019-01-13 01:30:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 14288 transitions. [2019-01-13 01:30:26,006 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 14288 transitions. Word has length 97 [2019-01-13 01:30:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:30:26,007 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 14288 transitions. [2019-01-13 01:30:26,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:30:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 14288 transitions. [2019-01-13 01:30:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:30:26,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:30:26,014 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, 1, 1, 1] [2019-01-13 01:30:26,015 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:30:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:30:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1704207939, now seen corresponding path program 2 times [2019-01-13 01:30:26,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:30:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:30:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:26,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:30:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:30:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:30:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:30:26,117 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:30:26,336 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:30:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:30:26 BasicIcfg [2019-01-13 01:30:26,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:30:26,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:30:26,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:30:26,339 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:30:26,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:29:27" (3/4) ... [2019-01-13 01:30:26,345 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:30:26,553 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:30:26,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:30:26,554 INFO L168 Benchmark]: Toolchain (without parser) took 61065.85 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 946.0 MB in the beginning and 1.8 GB in the end (delta: -850.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-13 01:30:26,556 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:30:26,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 01:30:26,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.53 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. [2019-01-13 01:30:26,557 INFO L168 Benchmark]: Boogie Preprocessor took 91.68 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. [2019-01-13 01:30:26,557 INFO L168 Benchmark]: RCFGBuilder took 1344.94 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-01-13 01:30:26,557 INFO L168 Benchmark]: TraceAbstraction took 58476.96 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -791.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 01:30:26,561 INFO L168 Benchmark]: Witness Printer took 214.76 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-01-13 01:30:26,564 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 843.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.53 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 91.68 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 1344.94 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58476.96 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -791.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 214.76 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L686] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L687] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L688] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L689] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L690] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L691] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L692] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L693] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L694] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L695] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L696] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L697] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L698] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L699] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L700] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L701] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t903; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L705] 0 z$w_buff1 = z$w_buff0 [L706] 0 z$w_buff0 = 1 [L707] 0 z$w_buff1_used = z$w_buff0_used [L708] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L711] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L712] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L713] 0 z$r_buff0_thd1 = (_Bool)1 [L716] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] -1 pthread_t t904; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] FCALL, FORK -1 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 x = 1 [L736] 1 y = 1 [L739] 1 __unbuffered_p1_EAX = y [L742] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L743] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L744] 1 z$flush_delayed = weak$$choice2 [L745] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L747] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L749] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L752] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L722] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L723] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L726] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$flush_delayed ? z$mem_tmp : z [L755] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L792] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L793] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L796] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 224 locations, 3 error locations. UNSAFE Result, 58.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9066 SDtfs, 10223 SDslu, 21038 SDs, 0 SdLazy, 9538 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 79 SyntacticMatches, 33 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74882occurred in iteration=6, 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: 16.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 159040 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2307 ConstructedInterpolants, 0 QuantifiedInterpolants, 471471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...