./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/podwr000_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/podwr000_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e7a5fd128b43965063c6e953cf4559ad2d9180d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:29:39,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:29:39,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:29:39,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:29:39,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:29:39,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:29:39,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:29:39,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:29:39,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:29:39,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:29:39,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:29:39,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:29:39,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:29:39,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:29:39,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:29:39,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:29:39,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:29:39,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:29:39,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:29:39,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:29:39,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:29:39,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:29:39,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:29:39,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:29:39,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:29:39,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:29:39,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:29:39,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:29:39,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:29:39,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:29:39,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:29:39,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:29:39,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:29:39,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:29:39,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:29:39,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:29:39,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:29:39,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:29:39,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:29:39,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:29:39,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:29:39,424 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:29:39,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:29:39,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:29:39,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:29:39,426 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:29:39,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:29:39,426 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:29:39,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:29:39,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:29:39,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:29:39,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:29:39,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:29:39,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:29:39,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:29:39,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:29:39,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:29:39,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:29:39,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:29:39,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:29:39,428 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 -> 1e7a5fd128b43965063c6e953cf4559ad2d9180d [2019-01-13 03:29:39,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:29:39,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:29:39,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:29:39,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:29:39,519 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:29:39,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/podwr000_power.opt_false-unreach-call.i [2019-01-13 03:29:39,588 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398bfdbef/f325a4473eca4d5694cb259d4bd2e72e/FLAGdc3305396 [2019-01-13 03:29:40,150 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:29:40,151 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/podwr000_power.opt_false-unreach-call.i [2019-01-13 03:29:40,167 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398bfdbef/f325a4473eca4d5694cb259d4bd2e72e/FLAGdc3305396 [2019-01-13 03:29:40,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398bfdbef/f325a4473eca4d5694cb259d4bd2e72e [2019-01-13 03:29:40,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:29:40,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:29:40,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:29:40,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:29:40,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:29:40,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:29:40" (1/1) ... [2019-01-13 03:29:40,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673f838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:40, skipping insertion in model container [2019-01-13 03:29:40,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:29:40" (1/1) ... [2019-01-13 03:29:40,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:29:40,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:29:41,054 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:29:41,075 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:29:41,241 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:29:41,336 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:29:41,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41 WrapperNode [2019-01-13 03:29:41,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:29:41,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:29:41,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:29:41,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:29:41,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:29:41,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:29:41,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:29:41,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:29:41,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... [2019-01-13 03:29:41,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:29:41,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:29:41,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:29:41,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:29:41,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:29:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:29:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:29:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:29:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:29:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:29:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:29:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:29:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:29:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:29:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:29:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:29:41,533 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:29:42,648 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:29:42,650 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:29:42,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:29:42 BoogieIcfgContainer [2019-01-13 03:29:42,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:29:42,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:29:42,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:29:42,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:29:42,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:29:40" (1/3) ... [2019-01-13 03:29:42,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600eb22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:29:42, skipping insertion in model container [2019-01-13 03:29:42,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:29:41" (2/3) ... [2019-01-13 03:29:42,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600eb22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:29:42, skipping insertion in model container [2019-01-13 03:29:42,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:29:42" (3/3) ... [2019-01-13 03:29:42,660 INFO L112 eAbstractionObserver]: Analyzing ICFG podwr000_power.opt_false-unreach-call.i [2019-01-13 03:29:42,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,709 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,718 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,719 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:29:42,778 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:29:42,779 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:29:42,788 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:29:42,806 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:29:42,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:29:42,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:29:42,830 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:29:42,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:29:42,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:29:42,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:29:42,831 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:29:42,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:29:42,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:29:42,847 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 03:29:45,313 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2019-01-13 03:29:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2019-01-13 03:29:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 03:29:45,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:45,330 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] [2019-01-13 03:29:45,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2019-01-13 03:29:45,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:45,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:29:45,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:29:45,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:29:45,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:45,707 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2019-01-13 03:29:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:47,311 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2019-01-13 03:29:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:29:47,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-13 03:29:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:47,722 INFO L225 Difference]: With dead ends: 60790 [2019-01-13 03:29:47,723 INFO L226 Difference]: Without dead ends: 44270 [2019-01-13 03:29:47,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2019-01-13 03:29:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2019-01-13 03:29:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2019-01-13 03:29:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2019-01-13 03:29:49,650 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2019-01-13 03:29:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:49,651 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2019-01-13 03:29:49,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:29:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2019-01-13 03:29:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:29:49,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:49,664 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] [2019-01-13 03:29:49,664 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2019-01-13 03:29:49,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:49,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:29:49,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:29:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:29:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:49,891 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2019-01-13 03:29:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:50,287 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2019-01-13 03:29:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:29:50,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 03:29:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:50,320 INFO L225 Difference]: With dead ends: 8528 [2019-01-13 03:29:50,322 INFO L226 Difference]: Without dead ends: 7466 [2019-01-13 03:29:50,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:29:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-01-13 03:29:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2019-01-13 03:29:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-01-13 03:29:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2019-01-13 03:29:50,533 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2019-01-13 03:29:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:50,535 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2019-01-13 03:29:50,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:29:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2019-01-13 03:29:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 03:29:50,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:50,539 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] [2019-01-13 03:29:50,539 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2019-01-13 03:29:50,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:50,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:50,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:29:50,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:29:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:29:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:29:50,801 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2019-01-13 03:29:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:52,116 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2019-01-13 03:29:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:29:52,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 03:29:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:52,170 INFO L225 Difference]: With dead ends: 13998 [2019-01-13 03:29:52,171 INFO L226 Difference]: Without dead ends: 13930 [2019-01-13 03:29:52,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:29:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-13 03:29:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2019-01-13 03:29:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-13 03:29:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2019-01-13 03:29:52,664 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2019-01-13 03:29:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:52,667 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2019-01-13 03:29:52,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:29:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2019-01-13 03:29:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:29:52,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:52,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:29:52,673 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2019-01-13 03:29:52,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:52,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:52,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:52,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:29:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:29:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:29:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:29:52,793 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2019-01-13 03:29:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:53,040 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2019-01-13 03:29:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:29:53,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-13 03:29:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:53,077 INFO L225 Difference]: With dead ends: 13279 [2019-01-13 03:29:53,077 INFO L226 Difference]: Without dead ends: 13279 [2019-01-13 03:29:53,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:29:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2019-01-13 03:29:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2019-01-13 03:29:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2019-01-13 03:29:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2019-01-13 03:29:53,358 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2019-01-13 03:29:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:53,359 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2019-01-13 03:29:53,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:29:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2019-01-13 03:29:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 03:29:53,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:53,365 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] [2019-01-13 03:29:53,366 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2019-01-13 03:29:53,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:53,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:53,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:53,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:53,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:29:53,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:29:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:29:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:29:53,816 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2019-01-13 03:29:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:54,838 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2019-01-13 03:29:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:29:54,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-13 03:29:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:54,875 INFO L225 Difference]: With dead ends: 12285 [2019-01-13 03:29:54,875 INFO L226 Difference]: Without dead ends: 12213 [2019-01-13 03:29:54,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:29:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2019-01-13 03:29:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2019-01-13 03:29:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-01-13 03:29:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2019-01-13 03:29:55,134 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2019-01-13 03:29:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:55,138 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2019-01-13 03:29:55,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:29:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2019-01-13 03:29:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 03:29:55,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:55,152 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] [2019-01-13 03:29:55,153 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:55,154 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2019-01-13 03:29:55,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:55,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:55,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:55,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:55,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:29:55,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:29:55,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:29:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:55,289 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2019-01-13 03:29:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:55,450 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2019-01-13 03:29:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:29:55,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-13 03:29:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:55,485 INFO L225 Difference]: With dead ends: 12396 [2019-01-13 03:29:55,485 INFO L226 Difference]: Without dead ends: 12396 [2019-01-13 03:29:55,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:29:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2019-01-13 03:29:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2019-01-13 03:29:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2019-01-13 03:29:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2019-01-13 03:29:55,796 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2019-01-13 03:29:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:55,797 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2019-01-13 03:29:55,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:29:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2019-01-13 03:29:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 03:29:55,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:55,807 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] [2019-01-13 03:29:55,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2019-01-13 03:29:55,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:55,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:55,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:29:55,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:29:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:29:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:29:55,986 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2019-01-13 03:29:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:56,830 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2019-01-13 03:29:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:29:56,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 03:29:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:56,879 INFO L225 Difference]: With dead ends: 20969 [2019-01-13 03:29:56,879 INFO L226 Difference]: Without dead ends: 20898 [2019-01-13 03:29:56,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:29:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2019-01-13 03:29:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2019-01-13 03:29:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2019-01-13 03:29:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2019-01-13 03:29:57,466 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2019-01-13 03:29:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:57,467 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2019-01-13 03:29:57,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:29:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2019-01-13 03:29:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:29:57,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:57,477 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] [2019-01-13 03:29:57,477 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2019-01-13 03:29:57,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:57,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:57,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:57,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:57,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:57,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:29:57,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:29:57,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:29:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:57,655 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2019-01-13 03:29:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:58,199 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2019-01-13 03:29:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:29:58,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:29:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:58,229 INFO L225 Difference]: With dead ends: 17635 [2019-01-13 03:29:58,229 INFO L226 Difference]: Without dead ends: 17635 [2019-01-13 03:29:58,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:29:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2019-01-13 03:29:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2019-01-13 03:29:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2019-01-13 03:29:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2019-01-13 03:29:58,490 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2019-01-13 03:29:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:58,490 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2019-01-13 03:29:58,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:29:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2019-01-13 03:29:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:29:58,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:58,501 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] [2019-01-13 03:29:58,501 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2019-01-13 03:29:58,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:58,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:58,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:58,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:29:58,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:29:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:29:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:29:58,633 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2019-01-13 03:29:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:29:59,118 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2019-01-13 03:29:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:29:59,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-13 03:29:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:29:59,146 INFO L225 Difference]: With dead ends: 16385 [2019-01-13 03:29:59,146 INFO L226 Difference]: Without dead ends: 16385 [2019-01-13 03:29:59,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:29:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2019-01-13 03:29:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2019-01-13 03:29:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2019-01-13 03:29:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2019-01-13 03:29:59,382 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2019-01-13 03:29:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:29:59,382 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2019-01-13 03:29:59,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:29:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2019-01-13 03:29:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:29:59,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:29:59,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:29:59,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:29:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:29:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2019-01-13 03:29:59,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:29:59,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:29:59,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:59,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:29:59,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:29:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:29:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:29:59,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:29:59,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:29:59,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:29:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:29:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:29:59,655 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2019-01-13 03:30:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:01,157 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2019-01-13 03:30:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:01,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 03:30:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:01,191 INFO L225 Difference]: With dead ends: 19821 [2019-01-13 03:30:01,191 INFO L226 Difference]: Without dead ends: 19821 [2019-01-13 03:30:01,192 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 [2019-01-13 03:30:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2019-01-13 03:30:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2019-01-13 03:30:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-01-13 03:30:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2019-01-13 03:30:01,699 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2019-01-13 03:30:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:01,699 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2019-01-13 03:30:01,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:30:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2019-01-13 03:30:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:30:01,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:01,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:01,711 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2019-01-13 03:30:01,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:01,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:01,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:02,123 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:30:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:02,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:02,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:30:02,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:30:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:30:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:30:02,208 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2019-01-13 03:30:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:02,950 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2019-01-13 03:30:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:30:02,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 03:30:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:02,984 INFO L225 Difference]: With dead ends: 21449 [2019-01-13 03:30:02,985 INFO L226 Difference]: Without dead ends: 21449 [2019-01-13 03:30:02,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2019-01-13 03:30:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2019-01-13 03:30:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2019-01-13 03:30:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2019-01-13 03:30:03,274 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2019-01-13 03:30:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:03,275 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2019-01-13 03:30:03,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:30:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2019-01-13 03:30:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:30:03,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:03,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:03,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2019-01-13 03:30:03,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:03,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:03,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:03,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:03,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:30:03,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:30:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:30:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:30:03,645 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2019-01-13 03:30:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:04,414 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2019-01-13 03:30:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:04,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:30:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:04,455 INFO L225 Difference]: With dead ends: 25024 [2019-01-13 03:30:04,455 INFO L226 Difference]: Without dead ends: 25024 [2019-01-13 03:30:04,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-01-13 03:30:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2019-01-13 03:30:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2019-01-13 03:30:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2019-01-13 03:30:04,798 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2019-01-13 03:30:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:04,798 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2019-01-13 03:30:04,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:30:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2019-01-13 03:30:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:30:04,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:04,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:04,812 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2019-01-13 03:30:04,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:04,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:04,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:05,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:05,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:30:05,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:30:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:30:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:30:05,070 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2019-01-13 03:30:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:05,153 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2019-01-13 03:30:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:30:05,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:30:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:05,162 INFO L225 Difference]: With dead ends: 7837 [2019-01-13 03:30:05,162 INFO L226 Difference]: Without dead ends: 6355 [2019-01-13 03:30:05,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-01-13 03:30:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2019-01-13 03:30:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-01-13 03:30:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2019-01-13 03:30:05,240 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2019-01-13 03:30:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:05,240 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2019-01-13 03:30:05,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:30:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2019-01-13 03:30:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:30:05,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:05,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] [2019-01-13 03:30:05,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2019-01-13 03:30:05,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:05,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:05,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:05,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:30:05,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:30:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:30:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:30:05,325 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2019-01-13 03:30:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:05,393 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2019-01-13 03:30:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:30:05,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 03:30:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:05,404 INFO L225 Difference]: With dead ends: 7505 [2019-01-13 03:30:05,404 INFO L226 Difference]: Without dead ends: 7505 [2019-01-13 03:30:05,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:30:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-13 03:30:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2019-01-13 03:30:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-01-13 03:30:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2019-01-13 03:30:05,475 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2019-01-13 03:30:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2019-01-13 03:30:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:30:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2019-01-13 03:30:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:30:05,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:05,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] [2019-01-13 03:30:05,485 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2019-01-13 03:30:05,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:05,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:05,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:30:05,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:30:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:30:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:30:05,838 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2019-01-13 03:30:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:06,391 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2019-01-13 03:30:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:30:06,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 03:30:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:06,403 INFO L225 Difference]: With dead ends: 6806 [2019-01-13 03:30:06,403 INFO L226 Difference]: Without dead ends: 6806 [2019-01-13 03:30:06,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2019-01-13 03:30:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2019-01-13 03:30:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2019-01-13 03:30:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2019-01-13 03:30:06,509 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2019-01-13 03:30:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:06,510 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2019-01-13 03:30:06,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:30:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2019-01-13 03:30:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:30:06,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:06,519 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] [2019-01-13 03:30:06,519 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2019-01-13 03:30:06,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:06,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:06,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:30:06,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:30:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:30:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:06,776 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2019-01-13 03:30:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:07,784 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2019-01-13 03:30:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:30:07,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-01-13 03:30:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:07,797 INFO L225 Difference]: With dead ends: 8112 [2019-01-13 03:30:07,797 INFO L226 Difference]: Without dead ends: 7993 [2019-01-13 03:30:07,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 03:30:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2019-01-13 03:30:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2019-01-13 03:30:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-01-13 03:30:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2019-01-13 03:30:07,889 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2019-01-13 03:30:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:07,889 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2019-01-13 03:30:07,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:30:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2019-01-13 03:30:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:30:07,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:07,900 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] [2019-01-13 03:30:07,900 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:07,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1174333635, now seen corresponding path program 1 times [2019-01-13 03:30:07,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:07,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:07,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:07,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:07,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:08,097 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-01-13 03:30:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:08,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:08,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:30:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:30:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:30:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:30:08,117 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2019-01-13 03:30:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:08,487 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2019-01-13 03:30:08,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:30:08,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:30:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:08,499 INFO L225 Difference]: With dead ends: 9854 [2019-01-13 03:30:08,500 INFO L226 Difference]: Without dead ends: 9854 [2019-01-13 03:30:08,500 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 [2019-01-13 03:30:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2019-01-13 03:30:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2019-01-13 03:30:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2019-01-13 03:30:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2019-01-13 03:30:08,587 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2019-01-13 03:30:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:08,588 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2019-01-13 03:30:08,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:30:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2019-01-13 03:30:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:30:08,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:08,598 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] [2019-01-13 03:30:08,599 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2019-01-13 03:30:08,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:08,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:08,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:30:08,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:30:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:30:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:30:08,855 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2019-01-13 03:30:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:09,732 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2019-01-13 03:30:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:30:09,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:30:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:09,743 INFO L225 Difference]: With dead ends: 7805 [2019-01-13 03:30:09,743 INFO L226 Difference]: Without dead ends: 7805 [2019-01-13 03:30:09,743 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 [2019-01-13 03:30:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2019-01-13 03:30:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2019-01-13 03:30:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-01-13 03:30:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2019-01-13 03:30:09,819 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2019-01-13 03:30:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:09,820 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2019-01-13 03:30:09,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:30:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2019-01-13 03:30:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:09,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:09,828 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1715163703, now seen corresponding path program 1 times [2019-01-13 03:30:09,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:10,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:10,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:30:10,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:30:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:30:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:10,089 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2019-01-13 03:30:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:10,958 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2019-01-13 03:30:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:10,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 03:30:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:10,971 INFO L225 Difference]: With dead ends: 8986 [2019-01-13 03:30:10,971 INFO L226 Difference]: Without dead ends: 8986 [2019-01-13 03:30:10,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2019-01-13 03:30:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2019-01-13 03:30:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-01-13 03:30:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2019-01-13 03:30:11,053 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2019-01-13 03:30:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:11,053 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2019-01-13 03:30:11,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:30:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2019-01-13 03:30:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:11,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:11,061 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] [2019-01-13 03:30:11,062 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2019-01-13 03:30:11,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:11,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:30:11,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:30:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:30:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:30:11,209 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2019-01-13 03:30:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:11,350 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2019-01-13 03:30:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:11,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:30:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:11,364 INFO L225 Difference]: With dead ends: 8130 [2019-01-13 03:30:11,364 INFO L226 Difference]: Without dead ends: 8130 [2019-01-13 03:30:11,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2019-01-13 03:30:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2019-01-13 03:30:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-01-13 03:30:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2019-01-13 03:30:11,447 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2019-01-13 03:30:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:11,448 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2019-01-13 03:30:11,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:30:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2019-01-13 03:30:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:11,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:11,455 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] [2019-01-13 03:30:11,455 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2019-01-13 03:30:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:30:11,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:30:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:30:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:30:11,646 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2019-01-13 03:30:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:12,194 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2019-01-13 03:30:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:30:12,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:30:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:12,208 INFO L225 Difference]: With dead ends: 9852 [2019-01-13 03:30:12,208 INFO L226 Difference]: Without dead ends: 9774 [2019-01-13 03:30:12,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-01-13 03:30:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2019-01-13 03:30:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-01-13 03:30:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2019-01-13 03:30:12,297 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2019-01-13 03:30:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:12,298 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2019-01-13 03:30:12,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:30:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2019-01-13 03:30:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:12,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:12,307 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] [2019-01-13 03:30:12,307 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2019-01-13 03:30:12,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:30:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:30:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:30:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:30:12,525 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2019-01-13 03:30:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:14,534 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2019-01-13 03:30:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:30:14,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 03:30:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:14,550 INFO L225 Difference]: With dead ends: 9349 [2019-01-13 03:30:14,550 INFO L226 Difference]: Without dead ends: 9270 [2019-01-13 03:30:14,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:30:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2019-01-13 03:30:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2019-01-13 03:30:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2019-01-13 03:30:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2019-01-13 03:30:14,655 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2019-01-13 03:30:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:14,655 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2019-01-13 03:30:14,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:30:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2019-01-13 03:30:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:14,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:14,664 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] [2019-01-13 03:30:14,664 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2019-01-13 03:30:14,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:14,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:30:14,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:30:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:30:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:14,855 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2019-01-13 03:30:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:15,576 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2019-01-13 03:30:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 03:30:15,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-01-13 03:30:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:15,590 INFO L225 Difference]: With dead ends: 9639 [2019-01-13 03:30:15,590 INFO L226 Difference]: Without dead ends: 9639 [2019-01-13 03:30:15,591 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 [2019-01-13 03:30:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-01-13 03:30:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2019-01-13 03:30:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2019-01-13 03:30:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2019-01-13 03:30:15,683 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2019-01-13 03:30:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:15,684 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2019-01-13 03:30:15,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:30:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2019-01-13 03:30:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:15,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:15,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:15,695 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:15,695 INFO L82 PathProgramCache]: Analyzing trace with hash -989900620, now seen corresponding path program 1 times [2019-01-13 03:30:15,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:15,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:30:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:30:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:30:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:30:15,794 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2019-01-13 03:30:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:15,911 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2019-01-13 03:30:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:30:15,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-13 03:30:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:15,923 INFO L225 Difference]: With dead ends: 8903 [2019-01-13 03:30:15,923 INFO L226 Difference]: Without dead ends: 8871 [2019-01-13 03:30:15,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:30:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-01-13 03:30:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2019-01-13 03:30:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2019-01-13 03:30:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2019-01-13 03:30:16,013 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2019-01-13 03:30:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:16,014 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2019-01-13 03:30:16,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:30:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2019-01-13 03:30:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:16,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:16,024 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] [2019-01-13 03:30:16,024 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2019-01-13 03:30:16,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:16,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:16,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:16,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:30:16,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:30:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:30:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:30:16,209 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2019-01-13 03:30:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:16,880 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2019-01-13 03:30:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:30:16,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 03:30:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:16,897 INFO L225 Difference]: With dead ends: 13198 [2019-01-13 03:30:16,897 INFO L226 Difference]: Without dead ends: 13198 [2019-01-13 03:30:16,898 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 [2019-01-13 03:30:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2019-01-13 03:30:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2019-01-13 03:30:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-01-13 03:30:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2019-01-13 03:30:17,074 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2019-01-13 03:30:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:17,074 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2019-01-13 03:30:17,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:30:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2019-01-13 03:30:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:30:17,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:17,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:17,085 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2019-01-13 03:30:17,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:17,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:17,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:30:17,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:30:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:30:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:30:17,198 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 3 states. [2019-01-13 03:30:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:17,259 INFO L93 Difference]: Finished difference Result 9013 states and 20482 transitions. [2019-01-13 03:30:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:30:17,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-13 03:30:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:17,272 INFO L225 Difference]: With dead ends: 9013 [2019-01-13 03:30:17,272 INFO L226 Difference]: Without dead ends: 8981 [2019-01-13 03:30:17,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:30:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2019-01-13 03:30:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 7523. [2019-01-13 03:30:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7523 states. [2019-01-13 03:30:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7523 states to 7523 states and 17031 transitions. [2019-01-13 03:30:17,357 INFO L78 Accepts]: Start accepts. Automaton has 7523 states and 17031 transitions. Word has length 93 [2019-01-13 03:30:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:17,357 INFO L480 AbstractCegarLoop]: Abstraction has 7523 states and 17031 transitions. [2019-01-13 03:30:17,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:30:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7523 states and 17031 transitions. [2019-01-13 03:30:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:17,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:17,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:17,366 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -360597677, now seen corresponding path program 1 times [2019-01-13 03:30:17,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:30:17,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:30:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:30:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:30:17,707 INFO L87 Difference]: Start difference. First operand 7523 states and 17031 transitions. Second operand 11 states. [2019-01-13 03:30:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:19,394 INFO L93 Difference]: Finished difference Result 10123 states and 22667 transitions. [2019-01-13 03:30:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 03:30:19,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-13 03:30:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:19,408 INFO L225 Difference]: With dead ends: 10123 [2019-01-13 03:30:19,408 INFO L226 Difference]: Without dead ends: 10123 [2019-01-13 03:30:19,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-01-13 03:30:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10123 states. [2019-01-13 03:30:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10123 to 8899. [2019-01-13 03:30:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8899 states. [2019-01-13 03:30:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8899 states to 8899 states and 20022 transitions. [2019-01-13 03:30:19,508 INFO L78 Accepts]: Start accepts. Automaton has 8899 states and 20022 transitions. Word has length 95 [2019-01-13 03:30:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:19,509 INFO L480 AbstractCegarLoop]: Abstraction has 8899 states and 20022 transitions. [2019-01-13 03:30:19,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:30:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8899 states and 20022 transitions. [2019-01-13 03:30:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:19,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:19,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:19,519 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1550303339, now seen corresponding path program 1 times [2019-01-13 03:30:19,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:19,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:19,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:19,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:30:19,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:30:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:30:19,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:19,716 INFO L87 Difference]: Start difference. First operand 8899 states and 20022 transitions. Second operand 9 states. [2019-01-13 03:30:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:20,510 INFO L93 Difference]: Finished difference Result 11077 states and 24615 transitions. [2019-01-13 03:30:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:30:20,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-13 03:30:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:20,525 INFO L225 Difference]: With dead ends: 11077 [2019-01-13 03:30:20,525 INFO L226 Difference]: Without dead ends: 11077 [2019-01-13 03:30:20,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-01-13 03:30:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11077 states. [2019-01-13 03:30:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11077 to 9328. [2019-01-13 03:30:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9328 states. [2019-01-13 03:30:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9328 states to 9328 states and 20940 transitions. [2019-01-13 03:30:20,629 INFO L78 Accepts]: Start accepts. Automaton has 9328 states and 20940 transitions. Word has length 95 [2019-01-13 03:30:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:20,629 INFO L480 AbstractCegarLoop]: Abstraction has 9328 states and 20940 transitions. [2019-01-13 03:30:20,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:30:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9328 states and 20940 transitions. [2019-01-13 03:30:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:20,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:20,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:20,640 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2019-01-13 03:30:20,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:20,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:20,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:30:20,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:30:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:30:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:30:20,949 INFO L87 Difference]: Start difference. First operand 9328 states and 20940 transitions. Second operand 9 states. [2019-01-13 03:30:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:21,549 INFO L93 Difference]: Finished difference Result 10252 states and 22965 transitions. [2019-01-13 03:30:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 03:30:21,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-13 03:30:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:21,563 INFO L225 Difference]: With dead ends: 10252 [2019-01-13 03:30:21,563 INFO L226 Difference]: Without dead ends: 10252 [2019-01-13 03:30:21,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-01-13 03:30:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10252 states. [2019-01-13 03:30:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10252 to 7051. [2019-01-13 03:30:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7051 states. [2019-01-13 03:30:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 15813 transitions. [2019-01-13 03:30:21,655 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 15813 transitions. Word has length 95 [2019-01-13 03:30:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:21,655 INFO L480 AbstractCegarLoop]: Abstraction has 7051 states and 15813 transitions. [2019-01-13 03:30:21,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:30:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 15813 transitions. [2019-01-13 03:30:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:21,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:21,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:21,663 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2019-01-13 03:30:21,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:21,872 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:30:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:21,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:30:21,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:30:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:30:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:30:21,967 INFO L87 Difference]: Start difference. First operand 7051 states and 15813 transitions. Second operand 11 states. [2019-01-13 03:30:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:23,720 INFO L93 Difference]: Finished difference Result 13327 states and 30077 transitions. [2019-01-13 03:30:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:30:23,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-13 03:30:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:23,732 INFO L225 Difference]: With dead ends: 13327 [2019-01-13 03:30:23,733 INFO L226 Difference]: Without dead ends: 9210 [2019-01-13 03:30:23,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:30:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9210 states. [2019-01-13 03:30:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9210 to 6887. [2019-01-13 03:30:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2019-01-13 03:30:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 15403 transitions. [2019-01-13 03:30:23,814 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 15403 transitions. Word has length 95 [2019-01-13 03:30:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:23,814 INFO L480 AbstractCegarLoop]: Abstraction has 6887 states and 15403 transitions. [2019-01-13 03:30:23,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:30:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 15403 transitions. [2019-01-13 03:30:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:23,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:23,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:23,822 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1071746382, now seen corresponding path program 1 times [2019-01-13 03:30:23,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:23,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:24,243 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:30:24,595 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 03:30:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:24,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:30:24,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:30:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:30:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:30:24,608 INFO L87 Difference]: Start difference. First operand 6887 states and 15403 transitions. Second operand 6 states. [2019-01-13 03:30:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:24,804 INFO L93 Difference]: Finished difference Result 7785 states and 17167 transitions. [2019-01-13 03:30:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:24,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:30:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:24,814 INFO L225 Difference]: With dead ends: 7785 [2019-01-13 03:30:24,814 INFO L226 Difference]: Without dead ends: 7728 [2019-01-13 03:30:24,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2019-01-13 03:30:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 6910. [2019-01-13 03:30:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6910 states. [2019-01-13 03:30:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6910 states to 6910 states and 15291 transitions. [2019-01-13 03:30:24,887 INFO L78 Accepts]: Start accepts. Automaton has 6910 states and 15291 transitions. Word has length 95 [2019-01-13 03:30:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:24,887 INFO L480 AbstractCegarLoop]: Abstraction has 6910 states and 15291 transitions. [2019-01-13 03:30:24,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:30:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6910 states and 15291 transitions. [2019-01-13 03:30:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:24,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:24,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:24,896 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1408217134, now seen corresponding path program 2 times [2019-01-13 03:30:24,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:24,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:30:25,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:30:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:30:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:25,587 INFO L87 Difference]: Start difference. First operand 6910 states and 15291 transitions. Second operand 7 states. [2019-01-13 03:30:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:26,389 INFO L93 Difference]: Finished difference Result 9182 states and 19987 transitions. [2019-01-13 03:30:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:30:26,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:30:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:26,401 INFO L225 Difference]: With dead ends: 9182 [2019-01-13 03:30:26,401 INFO L226 Difference]: Without dead ends: 9182 [2019-01-13 03:30:26,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:30:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9182 states. [2019-01-13 03:30:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9182 to 7505. [2019-01-13 03:30:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7505 states. [2019-01-13 03:30:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7505 states to 7505 states and 16598 transitions. [2019-01-13 03:30:26,498 INFO L78 Accepts]: Start accepts. Automaton has 7505 states and 16598 transitions. Word has length 95 [2019-01-13 03:30:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:26,499 INFO L480 AbstractCegarLoop]: Abstraction has 7505 states and 16598 transitions. [2019-01-13 03:30:26,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:30:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7505 states and 16598 transitions. [2019-01-13 03:30:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:26,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:26,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:26,507 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 1 times [2019-01-13 03:30:26,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:26,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:26,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:30:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:27,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:27,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:30:27,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:30:27,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:30:27,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:30:27,001 INFO L87 Difference]: Start difference. First operand 7505 states and 16598 transitions. Second operand 6 states. [2019-01-13 03:30:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:27,359 INFO L93 Difference]: Finished difference Result 7753 states and 17098 transitions. [2019-01-13 03:30:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:30:27,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:30:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:27,371 INFO L225 Difference]: With dead ends: 7753 [2019-01-13 03:30:27,371 INFO L226 Difference]: Without dead ends: 7753 [2019-01-13 03:30:27,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:30:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7753 states. [2019-01-13 03:30:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7753 to 7382. [2019-01-13 03:30:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7382 states. [2019-01-13 03:30:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7382 states to 7382 states and 16327 transitions. [2019-01-13 03:30:27,469 INFO L78 Accepts]: Start accepts. Automaton has 7382 states and 16327 transitions. Word has length 95 [2019-01-13 03:30:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 7382 states and 16327 transitions. [2019-01-13 03:30:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:30:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 7382 states and 16327 transitions. [2019-01-13 03:30:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:27,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:27,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:27,480 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -741980621, now seen corresponding path program 2 times [2019-01-13 03:30:27,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:27,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:30:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:30:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:30:27,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:30:27,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:30:27,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:30:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:30:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:30:27,680 INFO L87 Difference]: Start difference. First operand 7382 states and 16327 transitions. Second operand 7 states. [2019-01-13 03:30:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:30:27,900 INFO L93 Difference]: Finished difference Result 9227 states and 20407 transitions. [2019-01-13 03:30:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:30:27,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:30:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:30:27,912 INFO L225 Difference]: With dead ends: 9227 [2019-01-13 03:30:27,913 INFO L226 Difference]: Without dead ends: 9227 [2019-01-13 03:30:27,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:30:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2019-01-13 03:30:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 6593. [2019-01-13 03:30:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6593 states. [2019-01-13 03:30:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 14493 transitions. [2019-01-13 03:30:28,010 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 14493 transitions. Word has length 95 [2019-01-13 03:30:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:30:28,010 INFO L480 AbstractCegarLoop]: Abstraction has 6593 states and 14493 transitions. [2019-01-13 03:30:28,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:30:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 14493 transitions. [2019-01-13 03:30:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:30:28,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:30:28,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:30:28,019 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:30:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:30:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2019-01-13 03:30:28,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:30:28,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:30:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:28,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:30:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:30:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:30:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:30:28,108 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:30:28,321 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:30:28,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:30:28 BasicIcfg [2019-01-13 03:30:28,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:30:28,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:30:28,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:30:28,325 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:30:28,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:29:42" (3/4) ... [2019-01-13 03:30:28,330 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:30:28,487 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:30:28,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:30:28,488 INFO L168 Benchmark]: Toolchain (without parser) took 48059.65 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 952.7 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. [2019-01-13 03:30:28,490 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:30:28,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:30:28,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.03 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. [2019-01-13 03:30:28,493 INFO L168 Benchmark]: Boogie Preprocessor took 41.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:30:28,494 INFO L168 Benchmark]: RCFGBuilder took 1209.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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:30:28,495 INFO L168 Benchmark]: TraceAbstraction took 45670.32 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 03:30:28,495 INFO L168 Benchmark]: Witness Printer took 162.00 ms. Allocated memory is still 2.8 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:30:28,501 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 907.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.03 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 41.04 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 1209.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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45670.32 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 162.00 ms. Allocated memory is still 2.8 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1549; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1550; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 45.5s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8637 SDtfs, 9802 SDslu, 22458 SDs, 0 SdLazy, 10422 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 94 SyntacticMatches, 43 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, 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: 7.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 79310 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2598 ConstructedInterpolants, 0 QuantifiedInterpolants, 627355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...