./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/podwr000_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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_rmo.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 997e72260e6754a286f4a510b569d7771bd58960 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-91b1670 [2018-11-28 20:17:56,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:17:56,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:17:56,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:17:56,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:17:56,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:17:56,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:17:56,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:17:56,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:17:56,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:17:56,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:17:56,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:17:56,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:17:56,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:17:56,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:17:56,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:17:56,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:17:56,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:17:56,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:17:56,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:17:56,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:17:56,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:17:56,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:17:56,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:17:56,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:17:56,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:17:56,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:17:56,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:17:56,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:17:56,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:17:56,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:17:56,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:17:56,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:17:56,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:17:56,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:17:56,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:17:56,400 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:17:56,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:17:56,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:17:56,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:17:56,418 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:17:56,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:17:56,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:17:56,419 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:17:56,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:17:56,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:17:56,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:17:56,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:17:56,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:17:56,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:17:56,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:17:56,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:17:56,422 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:17:56,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:17:56,422 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:17:56,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:17:56,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:17:56,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:17:56,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:17:56,424 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:17:56,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:17:56,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:17:56,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:17:56,425 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:17:56,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:17:56,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:17:56,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:17:56,425 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 -> 997e72260e6754a286f4a510b569d7771bd58960 [2018-11-28 20:17:56,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:17:56,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:17:56,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:17:56,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:17:56,493 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:17:56,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/podwr000_rmo.opt_false-unreach-call.i [2018-11-28 20:17:56,561 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb3b30d5/266ae38548924ac39ce0c51c6da32466/FLAG7e876cc97 [2018-11-28 20:17:57,087 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:17:57,091 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/podwr000_rmo.opt_false-unreach-call.i [2018-11-28 20:17:57,112 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb3b30d5/266ae38548924ac39ce0c51c6da32466/FLAG7e876cc97 [2018-11-28 20:17:57,354 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb3b30d5/266ae38548924ac39ce0c51c6da32466 [2018-11-28 20:17:57,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:17:57,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:17:57,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:17:57,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:17:57,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:17:57,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:17:57" (1/1) ... [2018-11-28 20:17:57,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630ebf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:57, skipping insertion in model container [2018-11-28 20:17:57,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:17:57" (1/1) ... [2018-11-28 20:17:57,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:17:57,467 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:17:57,970 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:17:57,991 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:17:58,182 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:17:58,275 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:17:58,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58 WrapperNode [2018-11-28 20:17:58,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:17:58,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:17:58,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:17:58,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:17:58,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:17:58,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:17:58,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:17:58,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:17:58,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... [2018-11-28 20:17:58,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:17:58,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:17:58,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:17:58,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:17:58,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:17:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:17:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:17:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:17:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:17:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:17:58,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:17:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:17:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:17:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:17:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:17:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:17:58,488 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:17:59,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:17:59,589 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:17:59,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:59 BoogieIcfgContainer [2018-11-28 20:17:59,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:17:59,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:17:59,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:17:59,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:17:59,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:17:57" (1/3) ... [2018-11-28 20:17:59,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389b33f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:17:59, skipping insertion in model container [2018-11-28 20:17:59,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:58" (2/3) ... [2018-11-28 20:17:59,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389b33f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:17:59, skipping insertion in model container [2018-11-28 20:17:59,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:59" (3/3) ... [2018-11-28 20:17:59,603 INFO L112 eAbstractionObserver]: Analyzing ICFG podwr000_rmo.opt_false-unreach-call.i [2018-11-28 20:17:59,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,656 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,656 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,656 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,657 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,657 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,676 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,680 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:59,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:17:59,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:17:59,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:17:59,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:17:59,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:17:59,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:17:59,793 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:17:59,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:17:59,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:17:59,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:17:59,793 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:17:59,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:17:59,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:17:59,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 20:18:02,327 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 20:18:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 20:18:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 20:18:02,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:02,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:02,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:02,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-11-28 20:18:02,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:02,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:02,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:02,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:02,711 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 20:18:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:04,250 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 20:18:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:18:04,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 20:18:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:04,577 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 20:18:04,577 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 20:18:04,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 20:18:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 20:18:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 20:18:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 20:18:06,523 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 20:18:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:06,524 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 20:18:06,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 20:18:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:18:06,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:06,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:06,544 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:06,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-11-28 20:18:06,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:06,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:06,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:06,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:06,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:06,713 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 20:18:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:07,081 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 20:18:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:18:07,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 20:18:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:07,124 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 20:18:07,125 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 20:18:07,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 20:18:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 20:18:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 20:18:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 20:18:07,368 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 20:18:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:07,370 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 20:18:07,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 20:18:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:18:07,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:07,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:07,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:07,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-11-28 20:18:07,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:07,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:07,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:07,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:07,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:07,719 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 20:18:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:09,528 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 20:18:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:09,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:18:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:09,583 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 20:18:09,583 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 20:18:09,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 20:18:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 20:18:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 20:18:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 20:18:10,255 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 20:18:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:10,256 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 20:18:10,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 20:18:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:18:10,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:10,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:10,260 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:10,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-11-28 20:18:10,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:10,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:18:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:18:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:18:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:10,333 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 20:18:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:10,644 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 20:18:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:18:10,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 20:18:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:10,680 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 20:18:10,681 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 20:18:10,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 20:18:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 20:18:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 20:18:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 20:18:10,952 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 20:18:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:10,952 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 20:18:10,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:18:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 20:18:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 20:18:10,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:10,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:10,958 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:10,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-11-28 20:18:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:11,271 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:18:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:11,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:11,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:18:11,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:18:11,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:18:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:11,356 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 20:18:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:12,554 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 20:18:12,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:18:12,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 20:18:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:12,585 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 20:18:12,585 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 20:18:12,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:18:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 20:18:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 20:18:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 20:18:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 20:18:12,832 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 20:18:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:12,832 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 20:18:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:18:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 20:18:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:18:12,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:12,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:12,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:12,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-11-28 20:18:12,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:12,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:13,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:13,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:13,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:13,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:13,080 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 20:18:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:13,351 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 20:18:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:18:13,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 20:18:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:13,381 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 20:18:13,381 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 20:18:13,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 20:18:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 20:18:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 20:18:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 20:18:13,677 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 20:18:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:13,677 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 20:18:13,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 20:18:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:18:13,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:13,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:13,687 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:13,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-11-28 20:18:13,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:13,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:13,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:13,948 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 20:18:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:14,750 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 20:18:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:18:14,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 20:18:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:14,805 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 20:18:14,805 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 20:18:14,806 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 [2018-11-28 20:18:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 20:18:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 20:18:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 20:18:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 20:18:15,669 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 20:18:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:15,670 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 20:18:15,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 20:18:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:18:15,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:15,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:15,682 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:15,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-11-28 20:18:15,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:15,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:15,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:15,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:15,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:15,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:15,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:15,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:15,819 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 20:18:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:16,392 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-11-28 20:18:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:18:16,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:18:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:16,421 INFO L225 Difference]: With dead ends: 17635 [2018-11-28 20:18:16,421 INFO L226 Difference]: Without dead ends: 17635 [2018-11-28 20:18:16,422 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 [2018-11-28 20:18:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-11-28 20:18:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-11-28 20:18:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-11-28 20:18:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-11-28 20:18:16,686 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-11-28 20:18:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-11-28 20:18:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-11-28 20:18:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:18:16,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:16,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:16,706 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:16,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-11-28 20:18:16,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:16,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:16,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:16,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:18:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:18:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:18:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:16,825 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-11-28 20:18:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:17,345 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-11-28 20:18:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:18:17,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 20:18:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:17,373 INFO L225 Difference]: With dead ends: 16385 [2018-11-28 20:18:17,373 INFO L226 Difference]: Without dead ends: 16385 [2018-11-28 20:18:17,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-11-28 20:18:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-11-28 20:18:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-11-28 20:18:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-11-28 20:18:17,622 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-11-28 20:18:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-11-28 20:18:17,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:18:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-11-28 20:18:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:17,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:17,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:17,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:17,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-11-28 20:18:17,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:17,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:17,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:17,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:17,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:17,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:17,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:17,826 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-11-28 20:18:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:19,781 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-11-28 20:18:19,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:19,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:18:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:19,819 INFO L225 Difference]: With dead ends: 19821 [2018-11-28 20:18:19,819 INFO L226 Difference]: Without dead ends: 19821 [2018-11-28 20:18:19,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-11-28 20:18:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-11-28 20:18:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-11-28 20:18:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-11-28 20:18:20,119 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-11-28 20:18:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:20,120 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-11-28 20:18:20,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-11-28 20:18:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:20,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:20,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:20,136 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:20,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-11-28 20:18:20,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:20,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:20,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:20,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:20,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:20,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:20,418 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-11-28 20:18:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:20,991 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-11-28 20:18:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:18:20,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:18:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:21,027 INFO L225 Difference]: With dead ends: 21449 [2018-11-28 20:18:21,027 INFO L226 Difference]: Without dead ends: 21449 [2018-11-28 20:18:21,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-11-28 20:18:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-11-28 20:18:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-11-28 20:18:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-11-28 20:18:21,337 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-11-28 20:18:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:21,338 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-11-28 20:18:21,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-11-28 20:18:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:21,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:21,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:21,351 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:21,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-11-28 20:18:21,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:21,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:21,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:21,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:21,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:21,787 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-11-28 20:18:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:23,148 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-11-28 20:18:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:23,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:18:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:23,194 INFO L225 Difference]: With dead ends: 25024 [2018-11-28 20:18:23,195 INFO L226 Difference]: Without dead ends: 25024 [2018-11-28 20:18:23,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-11-28 20:18:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-11-28 20:18:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-11-28 20:18:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-11-28 20:18:23,587 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-11-28 20:18:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:23,588 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-11-28 20:18:23,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-11-28 20:18:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:23,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:23,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:23,604 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:23,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-11-28 20:18:23,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:23,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:23,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:23,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:23,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:23,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:23,869 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 6 states. [2018-11-28 20:18:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:25,057 INFO L93 Difference]: Finished difference Result 30713 states and 93495 transitions. [2018-11-28 20:18:25,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:18:25,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:18:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:25,118 INFO L225 Difference]: With dead ends: 30713 [2018-11-28 20:18:25,118 INFO L226 Difference]: Without dead ends: 30609 [2018-11-28 20:18:25,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2018-11-28 20:18:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 27953. [2018-11-28 20:18:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27953 states. [2018-11-28 20:18:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27953 states to 27953 states and 84685 transitions. [2018-11-28 20:18:26,165 INFO L78 Accepts]: Start accepts. Automaton has 27953 states and 84685 transitions. Word has length 66 [2018-11-28 20:18:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:26,165 INFO L480 AbstractCegarLoop]: Abstraction has 27953 states and 84685 transitions. [2018-11-28 20:18:26,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 27953 states and 84685 transitions. [2018-11-28 20:18:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:26,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:26,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:26,180 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:26,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-11-28 20:18:26,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:26,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:26,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:26,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:26,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:26,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:26,398 INFO L87 Difference]: Start difference. First operand 27953 states and 84685 transitions. Second operand 5 states. [2018-11-28 20:18:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:27,082 INFO L93 Difference]: Finished difference Result 40003 states and 119732 transitions. [2018-11-28 20:18:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:18:27,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:18:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:27,162 INFO L225 Difference]: With dead ends: 40003 [2018-11-28 20:18:27,162 INFO L226 Difference]: Without dead ends: 39851 [2018-11-28 20:18:27,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39851 states. [2018-11-28 20:18:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39851 to 35599. [2018-11-28 20:18:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35599 states. [2018-11-28 20:18:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35599 states to 35599 states and 107263 transitions. [2018-11-28 20:18:27,718 INFO L78 Accepts]: Start accepts. Automaton has 35599 states and 107263 transitions. Word has length 66 [2018-11-28 20:18:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:27,718 INFO L480 AbstractCegarLoop]: Abstraction has 35599 states and 107263 transitions. [2018-11-28 20:18:27,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35599 states and 107263 transitions. [2018-11-28 20:18:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:27,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:27,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:27,734 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:27,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-11-28 20:18:27,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:27,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:27,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:27,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:27,951 INFO L87 Difference]: Start difference. First operand 35599 states and 107263 transitions. Second operand 5 states. [2018-11-28 20:18:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:28,007 INFO L93 Difference]: Finished difference Result 9283 states and 22466 transitions. [2018-11-28 20:18:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:18:28,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:18:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:28,019 INFO L225 Difference]: With dead ends: 9283 [2018-11-28 20:18:28,019 INFO L226 Difference]: Without dead ends: 7431 [2018-11-28 20:18:28,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2018-11-28 20:18:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 6328. [2018-11-28 20:18:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-11-28 20:18:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14937 transitions. [2018-11-28 20:18:28,099 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14937 transitions. Word has length 66 [2018-11-28 20:18:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:28,100 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14937 transitions. [2018-11-28 20:18:28,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14937 transitions. [2018-11-28 20:18:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:18:28,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:28,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:28,107 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:28,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:28,108 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-11-28 20:18:28,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:28,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:28,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:28,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:18:28,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:18:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:18:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:28,187 INFO L87 Difference]: Start difference. First operand 6328 states and 14937 transitions. Second operand 3 states. [2018-11-28 20:18:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:28,427 INFO L93 Difference]: Finished difference Result 8755 states and 20596 transitions. [2018-11-28 20:18:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:18:28,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:18:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:28,444 INFO L225 Difference]: With dead ends: 8755 [2018-11-28 20:18:28,444 INFO L226 Difference]: Without dead ends: 8755 [2018-11-28 20:18:28,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:18:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2018-11-28 20:18:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 6267. [2018-11-28 20:18:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2018-11-28 20:18:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 14477 transitions. [2018-11-28 20:18:28,547 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 14477 transitions. Word has length 66 [2018-11-28 20:18:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:28,547 INFO L480 AbstractCegarLoop]: Abstraction has 6267 states and 14477 transitions. [2018-11-28 20:18:28,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:18:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 14477 transitions. [2018-11-28 20:18:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:18:28,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:28,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:28,556 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:28,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-11-28 20:18:28,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:28,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:28,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:28,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:28,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:28,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:28,931 INFO L87 Difference]: Start difference. First operand 6267 states and 14477 transitions. Second operand 5 states. [2018-11-28 20:18:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:29,402 INFO L93 Difference]: Finished difference Result 7437 states and 17118 transitions. [2018-11-28 20:18:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:18:29,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 20:18:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:29,412 INFO L225 Difference]: With dead ends: 7437 [2018-11-28 20:18:29,413 INFO L226 Difference]: Without dead ends: 7437 [2018-11-28 20:18:29,413 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 [2018-11-28 20:18:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2018-11-28 20:18:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 6711. [2018-11-28 20:18:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6711 states. [2018-11-28 20:18:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 15481 transitions. [2018-11-28 20:18:29,491 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 15481 transitions. Word has length 72 [2018-11-28 20:18:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:29,491 INFO L480 AbstractCegarLoop]: Abstraction has 6711 states and 15481 transitions. [2018-11-28 20:18:29,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 15481 transitions. [2018-11-28 20:18:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:18:29,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:29,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:29,498 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:29,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-11-28 20:18:29,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:29,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:18:29,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:18:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:18:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:29,737 INFO L87 Difference]: Start difference. First operand 6711 states and 15481 transitions. Second operand 9 states. [2018-11-28 20:18:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:30,591 INFO L93 Difference]: Finished difference Result 8913 states and 20402 transitions. [2018-11-28 20:18:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:18:30,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 20:18:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:30,605 INFO L225 Difference]: With dead ends: 8913 [2018-11-28 20:18:30,605 INFO L226 Difference]: Without dead ends: 8794 [2018-11-28 20:18:30,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:18:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8794 states. [2018-11-28 20:18:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8794 to 6808. [2018-11-28 20:18:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2018-11-28 20:18:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15574 transitions. [2018-11-28 20:18:30,695 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15574 transitions. Word has length 72 [2018-11-28 20:18:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:30,695 INFO L480 AbstractCegarLoop]: Abstraction has 6808 states and 15574 transitions. [2018-11-28 20:18:30,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:18:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15574 transitions. [2018-11-28 20:18:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:18:30,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:30,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:30,704 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:30,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1666827177, now seen corresponding path program 1 times [2018-11-28 20:18:30,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:30,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:30,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:30,813 INFO L87 Difference]: Start difference. First operand 6808 states and 15574 transitions. Second operand 4 states. [2018-11-28 20:18:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:31,122 INFO L93 Difference]: Finished difference Result 10575 states and 24061 transitions. [2018-11-28 20:18:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:18:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:18:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:31,137 INFO L225 Difference]: With dead ends: 10575 [2018-11-28 20:18:31,138 INFO L226 Difference]: Without dead ends: 10575 [2018-11-28 20:18:31,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2018-11-28 20:18:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 7928. [2018-11-28 20:18:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7928 states. [2018-11-28 20:18:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 17908 transitions. [2018-11-28 20:18:31,375 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 17908 transitions. Word has length 91 [2018-11-28 20:18:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:31,376 INFO L480 AbstractCegarLoop]: Abstraction has 7928 states and 17908 transitions. [2018-11-28 20:18:31,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 17908 transitions. [2018-11-28 20:18:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:18:31,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:31,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:31,386 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:31,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2018-11-28 20:18:31,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:31,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:31,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:18:31,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:18:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:18:31,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:18:31,603 INFO L87 Difference]: Start difference. First operand 7928 states and 17908 transitions. Second operand 4 states. [2018-11-28 20:18:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:31,727 INFO L93 Difference]: Finished difference Result 8493 states and 19201 transitions. [2018-11-28 20:18:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:18:31,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:18:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:31,737 INFO L225 Difference]: With dead ends: 8493 [2018-11-28 20:18:31,738 INFO L226 Difference]: Without dead ends: 8493 [2018-11-28 20:18:31,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2018-11-28 20:18:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 7834. [2018-11-28 20:18:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7834 states. [2018-11-28 20:18:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 17803 transitions. [2018-11-28 20:18:31,831 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 17803 transitions. Word has length 91 [2018-11-28 20:18:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:31,831 INFO L480 AbstractCegarLoop]: Abstraction has 7834 states and 17803 transitions. [2018-11-28 20:18:31,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:18:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 17803 transitions. [2018-11-28 20:18:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:31,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:31,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:31,841 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:31,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash -471503779, now seen corresponding path program 1 times [2018-11-28 20:18:31,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:31,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:31,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:31,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:31,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:31,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:31,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:18:31,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:18:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:18:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:31,983 INFO L87 Difference]: Start difference. First operand 7834 states and 17803 transitions. Second operand 7 states. [2018-11-28 20:18:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:35,126 INFO L93 Difference]: Finished difference Result 9672 states and 21911 transitions. [2018-11-28 20:18:35,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:35,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:18:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:35,141 INFO L225 Difference]: With dead ends: 9672 [2018-11-28 20:18:35,141 INFO L226 Difference]: Without dead ends: 9672 [2018-11-28 20:18:35,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2018-11-28 20:18:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 7946. [2018-11-28 20:18:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7946 states. [2018-11-28 20:18:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 18123 transitions. [2018-11-28 20:18:35,246 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 18123 transitions. Word has length 93 [2018-11-28 20:18:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:35,247 INFO L480 AbstractCegarLoop]: Abstraction has 7946 states and 18123 transitions. [2018-11-28 20:18:35,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:18:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 18123 transitions. [2018-11-28 20:18:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:35,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:35,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:35,257 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:35,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2018-11-28 20:18:35,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:35,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:35,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:35,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:35,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:35,456 INFO L87 Difference]: Start difference. First operand 7946 states and 18123 transitions. Second operand 5 states. [2018-11-28 20:18:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:35,583 INFO L93 Difference]: Finished difference Result 8853 states and 20081 transitions. [2018-11-28 20:18:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:35,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:18:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:35,596 INFO L225 Difference]: With dead ends: 8853 [2018-11-28 20:18:35,596 INFO L226 Difference]: Without dead ends: 8853 [2018-11-28 20:18:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2018-11-28 20:18:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 6842. [2018-11-28 20:18:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2018-11-28 20:18:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 15642 transitions. [2018-11-28 20:18:35,685 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 15642 transitions. Word has length 93 [2018-11-28 20:18:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:35,685 INFO L480 AbstractCegarLoop]: Abstraction has 6842 states and 15642 transitions. [2018-11-28 20:18:35,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 15642 transitions. [2018-11-28 20:18:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:35,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:35,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] [2018-11-28 20:18:35,695 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:35,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2018-11-28 20:18:35,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:35,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:35,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:35,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:35,958 INFO L87 Difference]: Start difference. First operand 6842 states and 15642 transitions. Second operand 5 states. [2018-11-28 20:18:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:36,534 INFO L93 Difference]: Finished difference Result 11344 states and 26131 transitions. [2018-11-28 20:18:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:18:36,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:18:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:36,549 INFO L225 Difference]: With dead ends: 11344 [2018-11-28 20:18:36,549 INFO L226 Difference]: Without dead ends: 11266 [2018-11-28 20:18:36,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2018-11-28 20:18:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 7983. [2018-11-28 20:18:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-11-28 20:18:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 18289 transitions. [2018-11-28 20:18:36,655 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 18289 transitions. Word has length 93 [2018-11-28 20:18:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:36,656 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 18289 transitions. [2018-11-28 20:18:36,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 18289 transitions. [2018-11-28 20:18:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:36,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:36,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:36,667 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:36,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2018-11-28 20:18:36,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:36,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:36,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:36,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:36,964 INFO L87 Difference]: Start difference. First operand 7983 states and 18289 transitions. Second operand 6 states. [2018-11-28 20:18:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:37,343 INFO L93 Difference]: Finished difference Result 10118 states and 23011 transitions. [2018-11-28 20:18:37,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:18:37,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:18:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:37,358 INFO L225 Difference]: With dead ends: 10118 [2018-11-28 20:18:37,358 INFO L226 Difference]: Without dead ends: 10039 [2018-11-28 20:18:37,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:18:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-11-28 20:18:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 7582. [2018-11-28 20:18:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2018-11-28 20:18:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 17399 transitions. [2018-11-28 20:18:37,461 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 17399 transitions. Word has length 93 [2018-11-28 20:18:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:37,461 INFO L480 AbstractCegarLoop]: Abstraction has 7582 states and 17399 transitions. [2018-11-28 20:18:37,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 17399 transitions. [2018-11-28 20:18:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:37,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:37,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:37,471 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:37,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2018-11-28 20:18:37,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:37,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:37,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:18:37,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:18:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:18:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:37,673 INFO L87 Difference]: Start difference. First operand 7582 states and 17399 transitions. Second operand 9 states. [2018-11-28 20:18:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:38,360 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-11-28 20:18:38,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:18:38,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-11-28 20:18:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:38,376 INFO L225 Difference]: With dead ends: 10662 [2018-11-28 20:18:38,376 INFO L226 Difference]: Without dead ends: 10630 [2018-11-28 20:18:38,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:18:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-11-28 20:18:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-11-28 20:18:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-11-28 20:18:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-11-28 20:18:38,498 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-11-28 20:18:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:38,498 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-11-28 20:18:38,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:18:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-11-28 20:18:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:38,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:38,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:38,509 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:38,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2018-11-28 20:18:38,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:38,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:38,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:18:38,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:18:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:18:38,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:38,703 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-11-28 20:18:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:39,221 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-11-28 20:18:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:18:39,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:18:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:39,242 INFO L225 Difference]: With dead ends: 14219 [2018-11-28 20:18:39,242 INFO L226 Difference]: Without dead ends: 14219 [2018-11-28 20:18:39,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:18:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-11-28 20:18:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-11-28 20:18:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-11-28 20:18:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-11-28 20:18:39,402 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-11-28 20:18:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-11-28 20:18:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:18:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-11-28 20:18:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:39,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:39,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:39,415 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:39,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2018-11-28 20:18:39,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:39,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:39,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:39,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:18:39,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:18:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:18:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:39,678 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 7 states. [2018-11-28 20:18:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:39,920 INFO L93 Difference]: Finished difference Result 13588 states and 31510 transitions. [2018-11-28 20:18:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:39,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:18:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:39,937 INFO L225 Difference]: With dead ends: 13588 [2018-11-28 20:18:39,938 INFO L226 Difference]: Without dead ends: 13588 [2018-11-28 20:18:39,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:18:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2018-11-28 20:18:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 9833. [2018-11-28 20:18:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9833 states. [2018-11-28 20:18:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9833 states to 9833 states and 22391 transitions. [2018-11-28 20:18:40,082 INFO L78 Accepts]: Start accepts. Automaton has 9833 states and 22391 transitions. Word has length 93 [2018-11-28 20:18:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:40,083 INFO L480 AbstractCegarLoop]: Abstraction has 9833 states and 22391 transitions. [2018-11-28 20:18:40,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:18:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 9833 states and 22391 transitions. [2018-11-28 20:18:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:40,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:40,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:40,096 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:40,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2018-11-28 20:18:40,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:40,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:40,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:40,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:40,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:40,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:40,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:40,411 INFO L87 Difference]: Start difference. First operand 9833 states and 22391 transitions. Second operand 6 states. [2018-11-28 20:18:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:40,562 INFO L93 Difference]: Finished difference Result 9353 states and 20935 transitions. [2018-11-28 20:18:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:40,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:18:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:40,575 INFO L225 Difference]: With dead ends: 9353 [2018-11-28 20:18:40,575 INFO L226 Difference]: Without dead ends: 9353 [2018-11-28 20:18:40,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2018-11-28 20:18:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5822. [2018-11-28 20:18:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-11-28 20:18:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13049 transitions. [2018-11-28 20:18:40,690 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13049 transitions. Word has length 93 [2018-11-28 20:18:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:40,690 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13049 transitions. [2018-11-28 20:18:40,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13049 transitions. [2018-11-28 20:18:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:40,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:40,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:40,698 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:40,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-11-28 20:18:40,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:40,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:41,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:41,011 INFO L87 Difference]: Start difference. First operand 5822 states and 13049 transitions. Second operand 5 states. [2018-11-28 20:18:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:41,061 INFO L93 Difference]: Finished difference Result 5822 states and 13033 transitions. [2018-11-28 20:18:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:18:41,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-28 20:18:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:41,070 INFO L225 Difference]: With dead ends: 5822 [2018-11-28 20:18:41,070 INFO L226 Difference]: Without dead ends: 5822 [2018-11-28 20:18:41,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2018-11-28 20:18:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 5822. [2018-11-28 20:18:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-11-28 20:18:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13033 transitions. [2018-11-28 20:18:41,132 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13033 transitions. Word has length 95 [2018-11-28 20:18:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:41,133 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13033 transitions. [2018-11-28 20:18:41,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13033 transitions. [2018-11-28 20:18:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:41,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:41,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:41,140 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:41,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-11-28 20:18:41,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:41,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:41,368 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:18:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:41,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:18:41,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:18:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:18:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:18:41,453 INFO L87 Difference]: Start difference. First operand 5822 states and 13033 transitions. Second operand 11 states. [2018-11-28 20:18:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:43,166 INFO L93 Difference]: Finished difference Result 10998 states and 24764 transitions. [2018-11-28 20:18:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:18:43,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:18:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:43,176 INFO L225 Difference]: With dead ends: 10998 [2018-11-28 20:18:43,177 INFO L226 Difference]: Without dead ends: 7682 [2018-11-28 20:18:43,177 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 [2018-11-28 20:18:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2018-11-28 20:18:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 5708. [2018-11-28 20:18:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-11-28 20:18:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 12720 transitions. [2018-11-28 20:18:43,246 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 12720 transitions. Word has length 95 [2018-11-28 20:18:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:43,246 INFO L480 AbstractCegarLoop]: Abstraction has 5708 states and 12720 transitions. [2018-11-28 20:18:43,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:18:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 12720 transitions. [2018-11-28 20:18:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:43,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:43,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:43,253 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:43,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:43,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2018-11-28 20:18:43,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:43,661 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:18:44,150 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:18:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:44,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:44,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:44,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:44,174 INFO L87 Difference]: Start difference. First operand 5708 states and 12720 transitions. Second operand 6 states. [2018-11-28 20:18:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:44,756 INFO L93 Difference]: Finished difference Result 6462 states and 14232 transitions. [2018-11-28 20:18:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:44,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:18:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:44,765 INFO L225 Difference]: With dead ends: 6462 [2018-11-28 20:18:44,765 INFO L226 Difference]: Without dead ends: 6432 [2018-11-28 20:18:44,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-11-28 20:18:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 5653. [2018-11-28 20:18:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2018-11-28 20:18:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 12502 transitions. [2018-11-28 20:18:44,830 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 12502 transitions. Word has length 95 [2018-11-28 20:18:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:44,831 INFO L480 AbstractCegarLoop]: Abstraction has 5653 states and 12502 transitions. [2018-11-28 20:18:44,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 12502 transitions. [2018-11-28 20:18:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:44,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:44,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:44,837 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:44,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 2 times [2018-11-28 20:18:44,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:44,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:44,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:44,961 INFO L87 Difference]: Start difference. First operand 5653 states and 12502 transitions. Second operand 6 states. [2018-11-28 20:18:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:45,184 INFO L93 Difference]: Finished difference Result 6090 states and 13395 transitions. [2018-11-28 20:18:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:18:45,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:18:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:45,193 INFO L225 Difference]: With dead ends: 6090 [2018-11-28 20:18:45,194 INFO L226 Difference]: Without dead ends: 6090 [2018-11-28 20:18:45,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2018-11-28 20:18:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5579. [2018-11-28 20:18:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-11-28 20:18:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 12324 transitions. [2018-11-28 20:18:45,258 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 12324 transitions. Word has length 95 [2018-11-28 20:18:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:45,258 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 12324 transitions. [2018-11-28 20:18:45,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 12324 transitions. [2018-11-28 20:18:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:45,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:45,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:45,266 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-11-28 20:18:45,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:45,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:18:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:18:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:18:45,369 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:18:45,596 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:18:45,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:18:45 BasicIcfg [2018-11-28 20:18:45,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:18:45,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:18:45,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:18:45,601 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:18:45,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:59" (3/4) ... [2018-11-28 20:18:45,606 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:18:45,763 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:18:45,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:18:45,766 INFO L168 Benchmark]: Toolchain (without parser) took 48406.29 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 946.0 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 879.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,767 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:18:45,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 914.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,768 INFO L168 Benchmark]: Boogie Preprocessor took 64.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:18:45,768 INFO L168 Benchmark]: RCFGBuilder took 1173.72 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.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,771 INFO L168 Benchmark]: TraceAbstraction took 46008.43 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -963.7 MB). Peak memory consumption was 817.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,772 INFO L168 Benchmark]: Witness Printer took 163.19 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:45,777 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 914.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.25 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 1173.72 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.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46008.43 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -963.7 MB). Peak memory consumption was 817.8 MB. Max. memory is 11.5 GB. * Witness Printer took 163.19 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 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 t1557; 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(&t1557, ((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 [L772] -1 pthread_t t1558; 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] [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] [L773] FCALL, FORK -1 pthread_create(&t1558, ((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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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.8s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8461 SDtfs, 9386 SDslu, 19599 SDs, 0 SdLazy, 8854 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 84 SyntacticMatches, 31 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35599occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 84819 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 525251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...