./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dedc810acc4467f8e4edbf8d04a42f4c473bdb36 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:52:22,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:52:22,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:52:22,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:52:22,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:52:22,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:52:22,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:52:22,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:52:22,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:52:22,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:52:22,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:52:22,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:52:22,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:52:22,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:52:22,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:52:22,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:52:22,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:52:22,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:52:22,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:52:22,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:52:22,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:52:22,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:52:22,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:52:22,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:52:22,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:52:22,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:52:22,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:52:22,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:52:22,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:52:22,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:52:22,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:52:22,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:52:22,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:52:22,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:52:22,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:52:22,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:52:22,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:52:22,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:52:22,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:52:22,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:52:22,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:52:22,473 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:52:22,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:52:22,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:52:22,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:52:22,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:52:22,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:52:22,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:52:22,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:52:22,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:52:22,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:52:22,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:52:22,475 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:52:22,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:52:22,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:52:22,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:52:22,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:52:22,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:52:22,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:52:22,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:52:22,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:52:22,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:52:22,477 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:52:22,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:52:22,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:52:22,478 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 -> dedc810acc4467f8e4edbf8d04a42f4c473bdb36 [2018-12-31 22:52:22,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:52:22,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:52:22,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:52:22,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:52:22,544 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:52:22,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i [2018-12-31 22:52:22,611 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0c532e8/e564946a06c149488d8ec4c334d429c6/FLAG3dba0d783 [2018-12-31 22:52:23,299 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:52:23,300 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i [2018-12-31 22:52:23,317 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0c532e8/e564946a06c149488d8ec4c334d429c6/FLAG3dba0d783 [2018-12-31 22:52:23,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0c532e8/e564946a06c149488d8ec4c334d429c6 [2018-12-31 22:52:23,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:52:23,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:52:23,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:52:23,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:52:23,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:52:23,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:52:23" (1/1) ... [2018-12-31 22:52:23,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cb7b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:23, skipping insertion in model container [2018-12-31 22:52:23,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:52:23" (1/1) ... [2018-12-31 22:52:23,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:52:23,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:52:24,181 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:52:24,205 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:52:24,389 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:52:24,468 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:52:24,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24 WrapperNode [2018-12-31 22:52:24,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:52:24,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:52:24,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:52:24,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:52:24,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:52:24,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:52:24,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:52:24,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:52:24,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... [2018-12-31 22:52:24,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:52:24,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:52:24,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:52:24,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:52:24,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:52:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:52:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:52:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:52:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:52:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:52:24,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:52:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:52:24,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:52:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:52:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:52:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:52:24,662 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:52:25,841 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:52:25,842 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:52:25,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:52:25 BoogieIcfgContainer [2018-12-31 22:52:25,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:52:25,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:52:25,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:52:25,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:52:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:52:23" (1/3) ... [2018-12-31 22:52:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f171d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:52:25, skipping insertion in model container [2018-12-31 22:52:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:24" (2/3) ... [2018-12-31 22:52:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f171d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:52:25, skipping insertion in model container [2018-12-31 22:52:25,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:52:25" (3/3) ... [2018-12-31 22:52:25,854 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt_false-unreach-call.i [2018-12-31 22:52:25,903 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,904 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,904 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,904 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,905 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,905 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,905 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:25,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:52:26,003 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:52:26,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:52:26,014 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:52:26,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:52:26,063 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:52:26,064 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:52:26,064 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:52:26,064 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:52:26,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:52:26,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:52:26,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:52:26,065 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:52:26,065 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:52:26,079 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-31 22:52:28,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-31 22:52:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-31 22:52:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 22:52:28,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:28,717 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] [2018-12-31 22:52:28,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-12-31 22:52:28,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:28,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:29,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:29,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:29,147 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-31 22:52:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:30,579 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-31 22:52:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:52:30,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 22:52:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:30,929 INFO L225 Difference]: With dead ends: 60790 [2018-12-31 22:52:30,929 INFO L226 Difference]: Without dead ends: 44270 [2018-12-31 22:52:30,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-31 22:52:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-31 22:52:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-31 22:52:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-31 22:52:32,710 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-31 22:52:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-31 22:52:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-31 22:52:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:52:32,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:32,732 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] [2018-12-31 22:52:32,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-12-31 22:52:32,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:32,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:32,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:32,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:32,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:32,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:32,897 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-31 22:52:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:33,236 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-31 22:52:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:52:33,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 22:52:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:33,272 INFO L225 Difference]: With dead ends: 8528 [2018-12-31 22:52:33,273 INFO L226 Difference]: Without dead ends: 7466 [2018-12-31 22:52:33,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-31 22:52:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-31 22:52:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-31 22:52:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-31 22:52:33,516 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-31 22:52:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:33,518 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-31 22:52:33,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-31 22:52:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:52:33,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:33,522 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] [2018-12-31 22:52:33,522 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-12-31 22:52:33,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:33,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:33,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:52:33,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:52:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:52:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:33,844 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-31 22:52:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:35,427 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-31 22:52:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:52:35,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 22:52:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:35,483 INFO L225 Difference]: With dead ends: 13998 [2018-12-31 22:52:35,484 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 22:52:35,484 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 [2018-12-31 22:52:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 22:52:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-31 22:52:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-31 22:52:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-31 22:52:36,159 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-31 22:52:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:36,161 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-31 22:52:36,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:52:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-31 22:52:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 22:52:36,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:36,165 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] [2018-12-31 22:52:36,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-12-31 22:52:36,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:36,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:36,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:36,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:36,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:52:36,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:52:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:52:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:36,281 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-31 22:52:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:36,467 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-31 22:52:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:52:36,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-31 22:52:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:36,505 INFO L225 Difference]: With dead ends: 13279 [2018-12-31 22:52:36,505 INFO L226 Difference]: Without dead ends: 13279 [2018-12-31 22:52:36,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-31 22:52:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-31 22:52:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-31 22:52:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-31 22:52:36,800 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-31 22:52:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:36,801 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-31 22:52:36,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:52:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-31 22:52:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 22:52:36,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:36,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] [2018-12-31 22:52:36,805 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-12-31 22:52:36,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:36,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:37,075 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 22:52:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:52:37,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:52:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:52:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:52:37,392 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-31 22:52:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:38,494 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-31 22:52:38,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:52:38,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 22:52:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:38,524 INFO L225 Difference]: With dead ends: 12285 [2018-12-31 22:52:38,524 INFO L226 Difference]: Without dead ends: 12213 [2018-12-31 22:52:38,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:52:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-31 22:52:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-31 22:52:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-31 22:52:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-31 22:52:38,788 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-31 22:52:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:38,788 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-31 22:52:38,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:52:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-31 22:52:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 22:52:38,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:38,796 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] [2018-12-31 22:52:38,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-12-31 22:52:38,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:38,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:38,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:38,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:39,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:39,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:39,017 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-31 22:52:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:39,304 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-31 22:52:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:52:39,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-31 22:52:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:39,329 INFO L225 Difference]: With dead ends: 12396 [2018-12-31 22:52:39,329 INFO L226 Difference]: Without dead ends: 12396 [2018-12-31 22:52:39,329 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 [2018-12-31 22:52:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-31 22:52:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-31 22:52:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-31 22:52:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-31 22:52:39,649 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-31 22:52:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:39,650 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-31 22:52:39,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-31 22:52:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 22:52:39,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:39,660 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] [2018-12-31 22:52:39,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-12-31 22:52:39,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:40,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:40,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:52:40,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:52:40,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:52:40,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:52:40,089 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-31 22:52:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:41,199 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-31 22:52:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:52:41,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-31 22:52:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:41,245 INFO L225 Difference]: With dead ends: 20969 [2018-12-31 22:52:41,245 INFO L226 Difference]: Without dead ends: 20898 [2018-12-31 22:52:41,246 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 [2018-12-31 22:52:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-31 22:52:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-31 22:52:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-31 22:52:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-31 22:52:41,964 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-31 22:52:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:41,964 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-31 22:52:41,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:52:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-31 22:52:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 22:52:41,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:41,976 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] [2018-12-31 22:52:41,976 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1900874254, now seen corresponding path program 1 times [2018-12-31 22:52:41,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:41,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:42,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:42,149 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-31 22:52:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:42,690 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-31 22:52:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:52:42,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 22:52:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:42,736 INFO L225 Difference]: With dead ends: 23352 [2018-12-31 22:52:42,736 INFO L226 Difference]: Without dead ends: 23352 [2018-12-31 22:52:42,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-31 22:52:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-31 22:52:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-31 22:52:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-31 22:52:43,069 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-31 22:52:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:43,070 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-31 22:52:43,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-31 22:52:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 22:52:43,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:43,083 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] [2018-12-31 22:52:43,083 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2100690035, now seen corresponding path program 1 times [2018-12-31 22:52:43,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:43,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:43,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:43,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:43,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:43,351 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-31 22:52:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:43,961 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-31 22:52:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:52:43,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 22:52:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:43,996 INFO L225 Difference]: With dead ends: 18411 [2018-12-31 22:52:43,996 INFO L226 Difference]: Without dead ends: 18411 [2018-12-31 22:52:43,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-31 22:52:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-31 22:52:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-31 22:52:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-31 22:52:44,293 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-31 22:52:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-31 22:52:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-31 22:52:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 22:52:44,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:44,308 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] [2018-12-31 22:52:44,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1139076018, now seen corresponding path program 1 times [2018-12-31 22:52:44,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:44,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:52:44,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:52:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:52:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:44,386 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-31 22:52:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:45,034 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-31 22:52:45,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:52:45,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 22:52:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:45,067 INFO L225 Difference]: With dead ends: 17193 [2018-12-31 22:52:45,068 INFO L226 Difference]: Without dead ends: 17193 [2018-12-31 22:52:45,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-31 22:52:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-31 22:52:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-31 22:52:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-31 22:52:45,332 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-31 22:52:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:45,333 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-31 22:52:45,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:52:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-31 22:52:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:45,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:45,349 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] [2018-12-31 22:52:45,349 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 380916983, now seen corresponding path program 1 times [2018-12-31 22:52:45,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:45,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:52:45,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:52:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:52:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:52:45,914 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-31 22:52:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:47,524 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-31 22:52:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:52:47,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 22:52:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:47,562 INFO L225 Difference]: With dead ends: 20789 [2018-12-31 22:52:47,562 INFO L226 Difference]: Without dead ends: 20789 [2018-12-31 22:52:47,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:52:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-31 22:52:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-31 22:52:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-31 22:52:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-31 22:52:47,871 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-31 22:52:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:47,871 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-31 22:52:47,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:52:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-31 22:52:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:47,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:47,883 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] [2018-12-31 22:52:47,884 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1342531000, now seen corresponding path program 1 times [2018-12-31 22:52:47,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:48,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:52:48,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:52:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:52:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:52:48,071 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-31 22:52:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:49,440 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-31 22:52:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:52:49,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 22:52:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:49,480 INFO L225 Difference]: With dead ends: 22441 [2018-12-31 22:52:49,480 INFO L226 Difference]: Without dead ends: 22441 [2018-12-31 22:52:49,480 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 [2018-12-31 22:52:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-31 22:52:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-31 22:52:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-31 22:52:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-31 22:52:49,822 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-31 22:52:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:49,822 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-31 22:52:49,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:52:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-31 22:52:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:49,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:49,835 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] [2018-12-31 22:52:49,836 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1707671815, now seen corresponding path program 1 times [2018-12-31 22:52:49,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:49,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:49,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:49,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:50,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:50,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:52:50,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:52:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:52:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:50,234 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-31 22:52:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:50,941 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-31 22:52:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:52:50,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 22:52:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:50,991 INFO L225 Difference]: With dead ends: 26432 [2018-12-31 22:52:50,991 INFO L226 Difference]: Without dead ends: 26432 [2018-12-31 22:52:50,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:52:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-31 22:52:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-31 22:52:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-31 22:52:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-31 22:52:51,480 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-31 22:52:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:51,480 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-31 22:52:51,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:52:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-31 22:52:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:51,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:51,498 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] [2018-12-31 22:52:51,498 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2076761304, now seen corresponding path program 1 times [2018-12-31 22:52:51,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:51,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:51,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:51,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:51,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:51,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:51,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:52:51,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:52:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:52:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:51,917 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-31 22:52:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:52,915 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-31 22:52:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:52:52,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 22:52:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:52,974 INFO L225 Difference]: With dead ends: 33063 [2018-12-31 22:52:52,974 INFO L226 Difference]: Without dead ends: 33063 [2018-12-31 22:52:52,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:52:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-31 22:52:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-31 22:52:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-31 22:52:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-31 22:52:53,470 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-31 22:52:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:53,470 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-31 22:52:53,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:52:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-31 22:52:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:53,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:53,484 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] [2018-12-31 22:52:53,485 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash 269306841, now seen corresponding path program 1 times [2018-12-31 22:52:53,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:53,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:53,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:53,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:53,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:53,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:53,654 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-12-31 22:52:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:54,355 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-12-31 22:52:54,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:52:54,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 22:52:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:54,431 INFO L225 Difference]: With dead ends: 38903 [2018-12-31 22:52:54,431 INFO L226 Difference]: Without dead ends: 38671 [2018-12-31 22:52:54,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-12-31 22:52:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-12-31 22:52:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-31 22:52:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-31 22:52:55,060 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-31 22:52:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:55,061 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-31 22:52:55,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-31 22:52:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:55,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:55,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:52:55,078 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1527644518, now seen corresponding path program 1 times [2018-12-31 22:52:55,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:55,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:52:55,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:52:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:52:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:55,290 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 5 states. [2018-12-31 22:52:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:55,373 INFO L93 Difference]: Finished difference Result 9315 states and 22546 transitions. [2018-12-31 22:52:55,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:52:55,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 22:52:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:55,384 INFO L225 Difference]: With dead ends: 9315 [2018-12-31 22:52:55,384 INFO L226 Difference]: Without dead ends: 7463 [2018-12-31 22:52:55,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:52:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2018-12-31 22:52:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6360. [2018-12-31 22:52:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2018-12-31 22:52:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 15017 transitions. [2018-12-31 22:52:55,468 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 15017 transitions. Word has length 66 [2018-12-31 22:52:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 15017 transitions. [2018-12-31 22:52:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:52:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 15017 transitions. [2018-12-31 22:52:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:52:55,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:55,475 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] [2018-12-31 22:52:55,475 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-12-31 22:52:55,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:55,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:52:55,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:52:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:52:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:55,555 INFO L87 Difference]: Start difference. First operand 6360 states and 15017 transitions. Second operand 3 states. [2018-12-31 22:52:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:55,720 INFO L93 Difference]: Finished difference Result 8819 states and 20756 transitions. [2018-12-31 22:52:55,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:52:55,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 22:52:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:55,732 INFO L225 Difference]: With dead ends: 8819 [2018-12-31 22:52:55,733 INFO L226 Difference]: Without dead ends: 8819 [2018-12-31 22:52:55,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:52:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8819 states. [2018-12-31 22:52:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8819 to 6299. [2018-12-31 22:52:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2018-12-31 22:52:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 14557 transitions. [2018-12-31 22:52:55,821 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 14557 transitions. Word has length 66 [2018-12-31 22:52:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:55,822 INFO L480 AbstractCegarLoop]: Abstraction has 6299 states and 14557 transitions. [2018-12-31 22:52:55,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:52:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 14557 transitions. [2018-12-31 22:52:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 22:52:55,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:55,828 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] [2018-12-31 22:52:55,830 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-12-31 22:52:55,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:55,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:52:55,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:52:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:52:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:55,984 INFO L87 Difference]: Start difference. First operand 6299 states and 14557 transitions. Second operand 5 states. [2018-12-31 22:52:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:56,185 INFO L93 Difference]: Finished difference Result 7469 states and 17198 transitions. [2018-12-31 22:52:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:52:56,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-31 22:52:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:56,196 INFO L225 Difference]: With dead ends: 7469 [2018-12-31 22:52:56,196 INFO L226 Difference]: Without dead ends: 7469 [2018-12-31 22:52:56,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:52:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-31 22:52:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6743. [2018-12-31 22:52:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6743 states. [2018-12-31 22:52:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 15561 transitions. [2018-12-31 22:52:56,281 INFO L78 Accepts]: Start accepts. Automaton has 6743 states and 15561 transitions. Word has length 72 [2018-12-31 22:52:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:56,281 INFO L480 AbstractCegarLoop]: Abstraction has 6743 states and 15561 transitions. [2018-12-31 22:52:56,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:52:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6743 states and 15561 transitions. [2018-12-31 22:52:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 22:52:56,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:56,288 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] [2018-12-31 22:52:56,289 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:56,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-12-31 22:52:56,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:56,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:56,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:52:56,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:52:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:52:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:52:56,696 INFO L87 Difference]: Start difference. First operand 6743 states and 15561 transitions. Second operand 9 states. [2018-12-31 22:52:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:57,555 INFO L93 Difference]: Finished difference Result 8945 states and 20482 transitions. [2018-12-31 22:52:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 22:52:57,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-31 22:52:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:57,567 INFO L225 Difference]: With dead ends: 8945 [2018-12-31 22:52:57,567 INFO L226 Difference]: Without dead ends: 8826 [2018-12-31 22:52:57,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:52:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2018-12-31 22:52:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 6840. [2018-12-31 22:52:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2018-12-31 22:52:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 15654 transitions. [2018-12-31 22:52:57,659 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 15654 transitions. Word has length 72 [2018-12-31 22:52:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:57,660 INFO L480 AbstractCegarLoop]: Abstraction has 6840 states and 15654 transitions. [2018-12-31 22:52:57,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:52:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 15654 transitions. [2018-12-31 22:52:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:52:57,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:57,668 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] [2018-12-31 22:52:57,669 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1119414586, now seen corresponding path program 1 times [2018-12-31 22:52:57,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:57,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:57,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:57,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:57,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:57,742 INFO L87 Difference]: Start difference. First operand 6840 states and 15654 transitions. Second operand 4 states. [2018-12-31 22:52:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:58,106 INFO L93 Difference]: Finished difference Result 10607 states and 24141 transitions. [2018-12-31 22:52:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:52:58,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 22:52:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:58,123 INFO L225 Difference]: With dead ends: 10607 [2018-12-31 22:52:58,123 INFO L226 Difference]: Without dead ends: 10607 [2018-12-31 22:52:58,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10607 states. [2018-12-31 22:52:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10607 to 7960. [2018-12-31 22:52:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2018-12-31 22:52:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 17988 transitions. [2018-12-31 22:52:58,238 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 17988 transitions. Word has length 91 [2018-12-31 22:52:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:58,238 INFO L480 AbstractCegarLoop]: Abstraction has 7960 states and 17988 transitions. [2018-12-31 22:52:58,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 17988 transitions. [2018-12-31 22:52:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:52:58,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:58,248 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] [2018-12-31 22:52:58,248 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1265743780, now seen corresponding path program 1 times [2018-12-31 22:52:58,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:58,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:58,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:52:58,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:52:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:52:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:52:58,496 INFO L87 Difference]: Start difference. First operand 7960 states and 17988 transitions. Second operand 4 states. [2018-12-31 22:52:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:52:58,893 INFO L93 Difference]: Finished difference Result 8525 states and 19281 transitions. [2018-12-31 22:52:58,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:52:58,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 22:52:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:52:58,905 INFO L225 Difference]: With dead ends: 8525 [2018-12-31 22:52:58,905 INFO L226 Difference]: Without dead ends: 8525 [2018-12-31 22:52:58,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:52:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2018-12-31 22:52:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 7866. [2018-12-31 22:52:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7866 states. [2018-12-31 22:52:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7866 states to 7866 states and 17883 transitions. [2018-12-31 22:52:59,002 INFO L78 Accepts]: Start accepts. Automaton has 7866 states and 17883 transitions. Word has length 91 [2018-12-31 22:52:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:52:59,002 INFO L480 AbstractCegarLoop]: Abstraction has 7866 states and 17883 transitions. [2018-12-31 22:52:59,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:52:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7866 states and 17883 transitions. [2018-12-31 22:52:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:52:59,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:52:59,012 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] [2018-12-31 22:52:59,012 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:52:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:52:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -248736448, now seen corresponding path program 1 times [2018-12-31 22:52:59,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:52:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:52:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:52:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:52:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:52:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:52:59,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:52:59,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:52:59,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:52:59,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:52:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:52:59,677 INFO L87 Difference]: Start difference. First operand 7866 states and 17883 transitions. Second operand 7 states. [2018-12-31 22:53:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:02,160 INFO L93 Difference]: Finished difference Result 9704 states and 21991 transitions. [2018-12-31 22:53:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:53:02,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 22:53:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:02,174 INFO L225 Difference]: With dead ends: 9704 [2018-12-31 22:53:02,174 INFO L226 Difference]: Without dead ends: 9704 [2018-12-31 22:53:02,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-31 22:53:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7978. [2018-12-31 22:53:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7978 states. [2018-12-31 22:53:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 18203 transitions. [2018-12-31 22:53:02,282 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 18203 transitions. Word has length 93 [2018-12-31 22:53:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:02,282 INFO L480 AbstractCegarLoop]: Abstraction has 7978 states and 18203 transitions. [2018-12-31 22:53:02,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 18203 transitions. [2018-12-31 22:53:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:02,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:02,294 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] [2018-12-31 22:53:02,294 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash 190059557, now seen corresponding path program 1 times [2018-12-31 22:53:02,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:02,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:02,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:02,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:02,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:02,485 INFO L87 Difference]: Start difference. First operand 7978 states and 18203 transitions. Second operand 5 states. [2018-12-31 22:53:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:02,618 INFO L93 Difference]: Finished difference Result 8885 states and 20161 transitions. [2018-12-31 22:53:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:53:02,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 22:53:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:02,629 INFO L225 Difference]: With dead ends: 8885 [2018-12-31 22:53:02,629 INFO L226 Difference]: Without dead ends: 8885 [2018-12-31 22:53:02,630 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 [2018-12-31 22:53:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2018-12-31 22:53:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6874. [2018-12-31 22:53:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2018-12-31 22:53:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 15722 transitions. [2018-12-31 22:53:02,723 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 15722 transitions. Word has length 93 [2018-12-31 22:53:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:02,723 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 15722 transitions. [2018-12-31 22:53:02,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 15722 transitions. [2018-12-31 22:53:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:02,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:02,734 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] [2018-12-31 22:53:02,734 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash -64676988, now seen corresponding path program 1 times [2018-12-31 22:53:02,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:02,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:02,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:02,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:02,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:02,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:02,914 INFO L87 Difference]: Start difference. First operand 6874 states and 15722 transitions. Second operand 5 states. [2018-12-31 22:53:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:03,277 INFO L93 Difference]: Finished difference Result 8122 states and 18362 transitions. [2018-12-31 22:53:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:53:03,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 22:53:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:03,288 INFO L225 Difference]: With dead ends: 8122 [2018-12-31 22:53:03,289 INFO L226 Difference]: Without dead ends: 7991 [2018-12-31 22:53:03,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-12-31 22:53:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 7613. [2018-12-31 22:53:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7613 states. [2018-12-31 22:53:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 17341 transitions. [2018-12-31 22:53:03,376 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 17341 transitions. Word has length 93 [2018-12-31 22:53:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:03,376 INFO L480 AbstractCegarLoop]: Abstraction has 7613 states and 17341 transitions. [2018-12-31 22:53:03,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 17341 transitions. [2018-12-31 22:53:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:03,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:03,384 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] [2018-12-31 22:53:03,384 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1180087493, now seen corresponding path program 1 times [2018-12-31 22:53:03,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:03,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:03,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:03,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:03,518 INFO L87 Difference]: Start difference. First operand 7613 states and 17341 transitions. Second operand 6 states. [2018-12-31 22:53:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:03,981 INFO L93 Difference]: Finished difference Result 9774 states and 22055 transitions. [2018-12-31 22:53:03,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:53:03,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 22:53:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:03,997 INFO L225 Difference]: With dead ends: 9774 [2018-12-31 22:53:03,997 INFO L226 Difference]: Without dead ends: 9666 [2018-12-31 22:53:03,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:53:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2018-12-31 22:53:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 7440. [2018-12-31 22:53:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2018-12-31 22:53:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 16947 transitions. [2018-12-31 22:53:04,102 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 16947 transitions. Word has length 93 [2018-12-31 22:53:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:04,102 INFO L480 AbstractCegarLoop]: Abstraction has 7440 states and 16947 transitions. [2018-12-31 22:53:04,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 16947 transitions. [2018-12-31 22:53:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:04,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:04,111 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] [2018-12-31 22:53:04,113 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 86477922, now seen corresponding path program 1 times [2018-12-31 22:53:04,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:04,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:04,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:04,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:04,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:53:04,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:53:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:53:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:53:04,297 INFO L87 Difference]: Start difference. First operand 7440 states and 16947 transitions. Second operand 9 states. [2018-12-31 22:53:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:04,979 INFO L93 Difference]: Finished difference Result 10479 states and 23806 transitions. [2018-12-31 22:53:04,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 22:53:04,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-31 22:53:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:04,995 INFO L225 Difference]: With dead ends: 10479 [2018-12-31 22:53:04,995 INFO L226 Difference]: Without dead ends: 10447 [2018-12-31 22:53:04,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 22:53:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10447 states. [2018-12-31 22:53:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10447 to 9008. [2018-12-31 22:53:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-12-31 22:53:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-12-31 22:53:05,122 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-12-31 22:53:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:05,123 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-12-31 22:53:05,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:53:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-12-31 22:53:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:05,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:05,135 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] [2018-12-31 22:53:05,135 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1710473437, now seen corresponding path program 1 times [2018-12-31 22:53:05,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:05,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:05,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:53:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:53:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:53:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:05,391 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-12-31 22:53:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:05,921 INFO L93 Difference]: Finished difference Result 14005 states and 32225 transitions. [2018-12-31 22:53:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:53:05,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-31 22:53:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:05,941 INFO L225 Difference]: With dead ends: 14005 [2018-12-31 22:53:05,941 INFO L226 Difference]: Without dead ends: 14005 [2018-12-31 22:53:05,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:53:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14005 states. [2018-12-31 22:53:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14005 to 9586. [2018-12-31 22:53:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9586 states. [2018-12-31 22:53:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 21908 transitions. [2018-12-31 22:53:06,127 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 21908 transitions. Word has length 93 [2018-12-31 22:53:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:06,127 INFO L480 AbstractCegarLoop]: Abstraction has 9586 states and 21908 transitions. [2018-12-31 22:53:06,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:53:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 21908 transitions. [2018-12-31 22:53:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:06,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:06,141 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] [2018-12-31 22:53:06,141 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -822969756, now seen corresponding path program 1 times [2018-12-31 22:53:06,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:53:06,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:53:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:53:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:53:06,394 INFO L87 Difference]: Start difference. First operand 9586 states and 21908 transitions. Second operand 10 states. [2018-12-31 22:53:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:07,481 INFO L93 Difference]: Finished difference Result 13508 states and 31016 transitions. [2018-12-31 22:53:07,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:53:07,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-31 22:53:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:07,499 INFO L225 Difference]: With dead ends: 13508 [2018-12-31 22:53:07,499 INFO L226 Difference]: Without dead ends: 13508 [2018-12-31 22:53:07,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-31 22:53:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13508 states. [2018-12-31 22:53:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13508 to 10602. [2018-12-31 22:53:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10602 states. [2018-12-31 22:53:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10602 states to 10602 states and 24114 transitions. [2018-12-31 22:53:07,662 INFO L78 Accepts]: Start accepts. Automaton has 10602 states and 24114 transitions. Word has length 93 [2018-12-31 22:53:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:07,662 INFO L480 AbstractCegarLoop]: Abstraction has 10602 states and 24114 transitions. [2018-12-31 22:53:07,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:53:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 10602 states and 24114 transitions. [2018-12-31 22:53:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:53:07,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:07,677 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] [2018-12-31 22:53:07,677 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1740021988, now seen corresponding path program 1 times [2018-12-31 22:53:07,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:07,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:07,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:07,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:07,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:07,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:07,957 INFO L87 Difference]: Start difference. First operand 10602 states and 24114 transitions. Second operand 6 states. [2018-12-31 22:53:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:08,127 INFO L93 Difference]: Finished difference Result 10122 states and 22658 transitions. [2018-12-31 22:53:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:53:08,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 22:53:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:08,143 INFO L225 Difference]: With dead ends: 10122 [2018-12-31 22:53:08,143 INFO L226 Difference]: Without dead ends: 10122 [2018-12-31 22:53:08,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-12-31 22:53:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 6952. [2018-12-31 22:53:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2018-12-31 22:53:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 15577 transitions. [2018-12-31 22:53:08,315 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 15577 transitions. Word has length 93 [2018-12-31 22:53:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:08,315 INFO L480 AbstractCegarLoop]: Abstraction has 6952 states and 15577 transitions. [2018-12-31 22:53:08,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 15577 transitions. [2018-12-31 22:53:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:53:08,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:08,323 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] [2018-12-31 22:53:08,324 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 672697743, now seen corresponding path program 1 times [2018-12-31 22:53:08,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:08,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:08,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:08,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:53:08,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:53:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:53:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:53:08,779 INFO L87 Difference]: Start difference. First operand 6952 states and 15577 transitions. Second operand 9 states. [2018-12-31 22:53:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:09,362 INFO L93 Difference]: Finished difference Result 8329 states and 18496 transitions. [2018-12-31 22:53:09,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:53:09,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 22:53:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:09,375 INFO L225 Difference]: With dead ends: 8329 [2018-12-31 22:53:09,375 INFO L226 Difference]: Without dead ends: 8329 [2018-12-31 22:53:09,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-31 22:53:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8329 states. [2018-12-31 22:53:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8329 to 8043. [2018-12-31 22:53:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8043 states. [2018-12-31 22:53:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8043 states to 8043 states and 17930 transitions. [2018-12-31 22:53:09,475 INFO L78 Accepts]: Start accepts. Automaton has 8043 states and 17930 transitions. Word has length 95 [2018-12-31 22:53:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:09,475 INFO L480 AbstractCegarLoop]: Abstraction has 8043 states and 17930 transitions. [2018-12-31 22:53:09,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:53:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8043 states and 17930 transitions. [2018-12-31 22:53:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:53:09,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:09,485 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] [2018-12-31 22:53:09,485 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1560201424, now seen corresponding path program 1 times [2018-12-31 22:53:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:09,778 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:53:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:09,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:09,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:53:09,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:53:09,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:53:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:53:09,913 INFO L87 Difference]: Start difference. First operand 8043 states and 17930 transitions. Second operand 11 states. [2018-12-31 22:53:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:11,617 INFO L93 Difference]: Finished difference Result 14746 states and 32962 transitions. [2018-12-31 22:53:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 22:53:11,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 22:53:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:11,633 INFO L225 Difference]: With dead ends: 14746 [2018-12-31 22:53:11,633 INFO L226 Difference]: Without dead ends: 10310 [2018-12-31 22:53:11,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 22:53:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10310 states. [2018-12-31 22:53:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10310 to 7815. [2018-12-31 22:53:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7815 states. [2018-12-31 22:53:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7815 states to 7815 states and 17392 transitions. [2018-12-31 22:53:11,747 INFO L78 Accepts]: Start accepts. Automaton has 7815 states and 17392 transitions. Word has length 95 [2018-12-31 22:53:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:11,747 INFO L480 AbstractCegarLoop]: Abstraction has 7815 states and 17392 transitions. [2018-12-31 22:53:11,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:53:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 7815 states and 17392 transitions. [2018-12-31 22:53:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:53:11,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:11,757 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] [2018-12-31 22:53:11,758 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash -961178655, now seen corresponding path program 1 times [2018-12-31 22:53:11,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:12,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:12,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:12,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:12,491 INFO L87 Difference]: Start difference. First operand 7815 states and 17392 transitions. Second operand 7 states. [2018-12-31 22:53:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:13,144 INFO L93 Difference]: Finished difference Result 9391 states and 20656 transitions. [2018-12-31 22:53:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:53:13,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 22:53:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:13,158 INFO L225 Difference]: With dead ends: 9391 [2018-12-31 22:53:13,158 INFO L226 Difference]: Without dead ends: 9371 [2018-12-31 22:53:13,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:53:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9371 states. [2018-12-31 22:53:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9371 to 8187. [2018-12-31 22:53:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2018-12-31 22:53:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 18101 transitions. [2018-12-31 22:53:13,263 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 18101 transitions. Word has length 95 [2018-12-31 22:53:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:13,264 INFO L480 AbstractCegarLoop]: Abstraction has 8187 states and 18101 transitions. [2018-12-31 22:53:13,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 18101 transitions. [2018-12-31 22:53:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:53:13,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:13,274 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] [2018-12-31 22:53:13,275 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash -143041951, now seen corresponding path program 2 times [2018-12-31 22:53:13,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:13,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:13,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:13,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:13,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:13,481 INFO L87 Difference]: Start difference. First operand 8187 states and 18101 transitions. Second operand 6 states. [2018-12-31 22:53:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:13,711 INFO L93 Difference]: Finished difference Result 8438 states and 18605 transitions. [2018-12-31 22:53:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:13,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 22:53:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:13,724 INFO L225 Difference]: With dead ends: 8438 [2018-12-31 22:53:13,724 INFO L226 Difference]: Without dead ends: 8438 [2018-12-31 22:53:13,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8438 states. [2018-12-31 22:53:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8438 to 7997. [2018-12-31 22:53:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7997 states. [2018-12-31 22:53:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 17677 transitions. [2018-12-31 22:53:13,821 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 17677 transitions. Word has length 95 [2018-12-31 22:53:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:13,822 INFO L480 AbstractCegarLoop]: Abstraction has 7997 states and 17677 transitions. [2018-12-31 22:53:13,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 17677 transitions. [2018-12-31 22:53:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:53:13,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:13,831 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] [2018-12-31 22:53:13,832 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash -631412894, now seen corresponding path program 2 times [2018-12-31 22:53:13,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:13,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:13,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:53:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:53:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:53:13,932 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:53:14,129 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:53:14,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:53:14 BasicIcfg [2018-12-31 22:53:14,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:53:14,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:53:14,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:53:14,134 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:53:14,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:52:25" (3/4) ... [2018-12-31 22:53:14,141 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:53:14,340 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:53:14,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:53:14,342 INFO L168 Benchmark]: Toolchain (without parser) took 50844.35 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -632.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,342 INFO L168 Benchmark]: CDTParser took 0.19 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. [2018-12-31 22:53:14,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 969.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,343 INFO L168 Benchmark]: Boogie Preprocessor took 46.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:53:14,344 INFO L168 Benchmark]: RCFGBuilder took 1260.13 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,344 INFO L168 Benchmark]: TraceAbstraction took 48288.96 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -552.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,344 INFO L168 Benchmark]: Witness Printer took 206.93 ms. Allocated memory is still 2.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-31 22:53:14,346 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.19 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 969.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.08 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 1260.13 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48288.96 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -552.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 206.93 ms. Allocated memory is still 2.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t1713; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1714; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 48.0s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8737 SDtfs, 10011 SDslu, 20810 SDs, 0 SdLazy, 9812 SolverSat, 481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 88 SyntacticMatches, 31 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=15, 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: 9.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 90501 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2415 ConstructedInterpolants, 0 QuantifiedInterpolants, 533254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...