./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix000_tso.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 a4dc61dcc3100553026c0b6a76926752a014539d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 22:29:38,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:29:38,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:29:38,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:29:38,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:29:38,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:29:38,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:29:38,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:29:38,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:29:38,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:29:38,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:29:38,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:29:38,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:29:38,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:29:38,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:29:38,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:29:38,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:29:38,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:29:38,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:29:38,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:29:38,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:29:38,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:29:38,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:29:38,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:29:38,365 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:29:38,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:29:38,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:29:38,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:29:38,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:29:38,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:29:38,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:29:38,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:29:38,371 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:29:38,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:29:38,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:29:38,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:29:38,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:29:38,387 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:29:38,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:29:38,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:29:38,389 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:29:38,389 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:29:38,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:29:38,389 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:29:38,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:29:38,391 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:29:38,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:29:38,391 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:29:38,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:29:38,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:29:38,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:29:38,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:29:38,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:29:38,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:29:38,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:29:38,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:29:38,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:29:38,393 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:29:38,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:29:38,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:29:38,393 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 -> a4dc61dcc3100553026c0b6a76926752a014539d [2019-01-12 22:29:38,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:29:38,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:29:38,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:29:38,452 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:29:38,453 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:29:38,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2019-01-12 22:29:38,513 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38ff38f/23fb5f37101645259d9477c0d4d3325e/FLAG959c6a73b [2019-01-12 22:29:39,021 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:29:39,021 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2019-01-12 22:29:39,047 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38ff38f/23fb5f37101645259d9477c0d4d3325e/FLAG959c6a73b [2019-01-12 22:29:39,321 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38ff38f/23fb5f37101645259d9477c0d4d3325e [2019-01-12 22:29:39,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:29:39,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:29:39,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:29:39,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:29:39,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:29:39,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:29:39" (1/1) ... [2019-01-12 22:29:39,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545503fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:39, skipping insertion in model container [2019-01-12 22:29:39,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:29:39" (1/1) ... [2019-01-12 22:29:39,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:29:39,410 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:29:39,929 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:29:39,956 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:29:40,120 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:29:40,205 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:29:40,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40 WrapperNode [2019-01-12 22:29:40,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:29:40,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:29:40,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:29:40,208 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:29:40,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:29:40,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:29:40,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:29:40,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:29:40,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... [2019-01-12 22:29:40,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:29:40,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:29:40,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:29:40,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:29:40,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:29:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:29:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:29:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:29:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:29:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 22:29:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 22:29:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 22:29:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 22:29:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:29:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:29:40,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:29:40,451 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:29:41,720 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:29:41,721 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 22:29:41,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:29:41 BoogieIcfgContainer [2019-01-12 22:29:41,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:29:41,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:29:41,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:29:41,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:29:41,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:29:39" (1/3) ... [2019-01-12 22:29:41,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f565ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:29:41, skipping insertion in model container [2019-01-12 22:29:41,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:29:40" (2/3) ... [2019-01-12 22:29:41,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f565ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:29:41, skipping insertion in model container [2019-01-12 22:29:41,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:29:41" (3/3) ... [2019-01-12 22:29:41,733 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt_false-unreach-call.i [2019-01-12 22:29:41,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,787 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,787 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,789 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,790 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,791 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,792 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,792 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,807 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,807 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,807 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,807 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,807 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,816 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,816 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:29:41,870 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:29:41,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:29:41,880 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 22:29:41,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 22:29:41,925 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:29:41,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:29:41,925 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:29:41,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:29:41,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:29:41,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:29:41,926 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:29:41,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:29:41,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:29:41,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2019-01-12 22:29:49,937 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2019-01-12 22:29:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2019-01-12 22:29:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 22:29:49,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:49,950 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] [2019-01-12 22:29:49,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2019-01-12 22:29:49,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:50,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:50,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:50,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:50,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:50,372 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2019-01-12 22:29:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:52,549 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2019-01-12 22:29:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:29:52,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-12 22:29:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:53,328 INFO L225 Difference]: With dead ends: 150584 [2019-01-12 22:29:53,328 INFO L226 Difference]: Without dead ends: 105840 [2019-01-12 22:29:53,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2019-01-12 22:29:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2019-01-12 22:29:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2019-01-12 22:29:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2019-01-12 22:29:58,402 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2019-01-12 22:29:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:58,403 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2019-01-12 22:29:58,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:29:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2019-01-12 22:29:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 22:29:58,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:58,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] [2019-01-12 22:29:58,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2019-01-12 22:29:58,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:58,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:58,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:58,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:29:58,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:29:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:29:58,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:58,560 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 5 states. [2019-01-12 22:30:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:00,852 INFO L93 Difference]: Finished difference Result 146040 states and 554301 transitions. [2019-01-12 22:30:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:30:00,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 22:30:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:01,718 INFO L225 Difference]: With dead ends: 146040 [2019-01-12 22:30:01,718 INFO L226 Difference]: Without dead ends: 145472 [2019-01-12 22:30:01,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145472 states. [2019-01-12 22:30:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145472 to 96614. [2019-01-12 22:30:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96614 states. [2019-01-12 22:30:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96614 states to 96614 states and 368456 transitions. [2019-01-12 22:30:10,257 INFO L78 Accepts]: Start accepts. Automaton has 96614 states and 368456 transitions. Word has length 47 [2019-01-12 22:30:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:10,258 INFO L480 AbstractCegarLoop]: Abstraction has 96614 states and 368456 transitions. [2019-01-12 22:30:10,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 96614 states and 368456 transitions. [2019-01-12 22:30:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:30:10,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:10,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] [2019-01-12 22:30:10,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1818908275, now seen corresponding path program 1 times [2019-01-12 22:30:10,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:10,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:10,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:10,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:10,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:10,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:10,388 INFO L87 Difference]: Start difference. First operand 96614 states and 368456 transitions. Second operand 5 states. [2019-01-12 22:30:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:13,162 INFO L93 Difference]: Finished difference Result 199270 states and 748090 transitions. [2019-01-12 22:30:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:30:13,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 22:30:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:13,700 INFO L225 Difference]: With dead ends: 199270 [2019-01-12 22:30:13,700 INFO L226 Difference]: Without dead ends: 198806 [2019-01-12 22:30:13,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198806 states. [2019-01-12 22:30:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198806 to 108297. [2019-01-12 22:30:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108297 states. [2019-01-12 22:30:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108297 states to 108297 states and 408660 transitions. [2019-01-12 22:30:18,649 INFO L78 Accepts]: Start accepts. Automaton has 108297 states and 408660 transitions. Word has length 48 [2019-01-12 22:30:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:18,650 INFO L480 AbstractCegarLoop]: Abstraction has 108297 states and 408660 transitions. [2019-01-12 22:30:18,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 108297 states and 408660 transitions. [2019-01-12 22:30:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:30:18,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:18,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:30:18,664 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash 963416755, now seen corresponding path program 1 times [2019-01-12 22:30:18,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:18,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:18,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:18,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:30:18,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:30:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:30:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:18,762 INFO L87 Difference]: Start difference. First operand 108297 states and 408660 transitions. Second operand 3 states. [2019-01-12 22:30:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:19,671 INFO L93 Difference]: Finished difference Result 179116 states and 655175 transitions. [2019-01-12 22:30:19,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:30:19,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 22:30:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:20,141 INFO L225 Difference]: With dead ends: 179116 [2019-01-12 22:30:20,141 INFO L226 Difference]: Without dead ends: 179116 [2019-01-12 22:30:20,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179116 states. [2019-01-12 22:30:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179116 to 163647. [2019-01-12 22:30:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163647 states. [2019-01-12 22:30:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163647 states to 163647 states and 603626 transitions. [2019-01-12 22:30:29,786 INFO L78 Accepts]: Start accepts. Automaton has 163647 states and 603626 transitions. Word has length 50 [2019-01-12 22:30:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:29,787 INFO L480 AbstractCegarLoop]: Abstraction has 163647 states and 603626 transitions. [2019-01-12 22:30:29,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:30:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 163647 states and 603626 transitions. [2019-01-12 22:30:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:30:29,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:29,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:30:29,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1320542462, now seen corresponding path program 1 times [2019-01-12 22:30:29,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:30:30,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:30:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:30:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:30:30,024 INFO L87 Difference]: Start difference. First operand 163647 states and 603626 transitions. Second operand 6 states. [2019-01-12 22:30:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:34,318 INFO L93 Difference]: Finished difference Result 315524 states and 1139599 transitions. [2019-01-12 22:30:34,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:30:34,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:30:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:35,189 INFO L225 Difference]: With dead ends: 315524 [2019-01-12 22:30:35,189 INFO L226 Difference]: Without dead ends: 314988 [2019-01-12 22:30:35,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:30:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314988 states. [2019-01-12 22:30:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314988 to 164410. [2019-01-12 22:30:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164410 states. [2019-01-12 22:30:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164410 states to 164410 states and 606497 transitions. [2019-01-12 22:30:48,539 INFO L78 Accepts]: Start accepts. Automaton has 164410 states and 606497 transitions. Word has length 54 [2019-01-12 22:30:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:48,539 INFO L480 AbstractCegarLoop]: Abstraction has 164410 states and 606497 transitions. [2019-01-12 22:30:48,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:30:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 164410 states and 606497 transitions. [2019-01-12 22:30:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:30:48,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:48,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:30:48,561 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash -842462784, now seen corresponding path program 1 times [2019-01-12 22:30:48,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:48,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:48,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:48,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:48,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:48,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:30:48,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:30:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:30:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:30:48,794 INFO L87 Difference]: Start difference. First operand 164410 states and 606497 transitions. Second operand 6 states. [2019-01-12 22:30:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:51,052 INFO L93 Difference]: Finished difference Result 215867 states and 792771 transitions. [2019-01-12 22:30:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:30:51,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:30:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:53,267 INFO L225 Difference]: With dead ends: 215867 [2019-01-12 22:30:53,267 INFO L226 Difference]: Without dead ends: 215867 [2019-01-12 22:30:53,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215867 states. [2019-01-12 22:30:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215867 to 201216. [2019-01-12 22:30:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201216 states. [2019-01-12 22:30:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201216 states to 201216 states and 739038 transitions. [2019-01-12 22:30:59,785 INFO L78 Accepts]: Start accepts. Automaton has 201216 states and 739038 transitions. Word has length 54 [2019-01-12 22:30:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:59,785 INFO L480 AbstractCegarLoop]: Abstraction has 201216 states and 739038 transitions. [2019-01-12 22:30:59,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:30:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 201216 states and 739038 transitions. [2019-01-12 22:30:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:30:59,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:59,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:30:59,809 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1655553153, now seen corresponding path program 1 times [2019-01-12 22:30:59,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:59,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:59,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:59,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:30:59,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:30:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:30:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:30:59,962 INFO L87 Difference]: Start difference. First operand 201216 states and 739038 transitions. Second operand 4 states. [2019-01-12 22:31:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:00,368 INFO L93 Difference]: Finished difference Result 38680 states and 122685 transitions. [2019-01-12 22:31:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:31:00,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-12 22:31:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:00,420 INFO L225 Difference]: With dead ends: 38680 [2019-01-12 22:31:00,420 INFO L226 Difference]: Without dead ends: 32084 [2019-01-12 22:31:00,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32084 states. [2019-01-12 22:31:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32084 to 31837. [2019-01-12 22:31:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31837 states. [2019-01-12 22:31:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31837 states to 31837 states and 99516 transitions. [2019-01-12 22:31:00,820 INFO L78 Accepts]: Start accepts. Automaton has 31837 states and 99516 transitions. Word has length 54 [2019-01-12 22:31:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:00,820 INFO L480 AbstractCegarLoop]: Abstraction has 31837 states and 99516 transitions. [2019-01-12 22:31:00,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:31:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31837 states and 99516 transitions. [2019-01-12 22:31:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 22:31:00,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:00,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:00,829 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1943714605, now seen corresponding path program 1 times [2019-01-12 22:31:00,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:00,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:00,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:00,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:31:01,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:31:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:31:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:01,000 INFO L87 Difference]: Start difference. First operand 31837 states and 99516 transitions. Second operand 4 states. [2019-01-12 22:31:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:01,376 INFO L93 Difference]: Finished difference Result 41209 states and 129950 transitions. [2019-01-12 22:31:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:31:01,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-12 22:31:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:01,442 INFO L225 Difference]: With dead ends: 41209 [2019-01-12 22:31:01,442 INFO L226 Difference]: Without dead ends: 41209 [2019-01-12 22:31:01,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41209 states. [2019-01-12 22:31:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41209 to 35933. [2019-01-12 22:31:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35933 states. [2019-01-12 22:31:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35933 states to 35933 states and 112645 transitions. [2019-01-12 22:31:01,941 INFO L78 Accepts]: Start accepts. Automaton has 35933 states and 112645 transitions. Word has length 64 [2019-01-12 22:31:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:01,942 INFO L480 AbstractCegarLoop]: Abstraction has 35933 states and 112645 transitions. [2019-01-12 22:31:01,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:31:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35933 states and 112645 transitions. [2019-01-12 22:31:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 22:31:01,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:01,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:01,951 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash -200904270, now seen corresponding path program 1 times [2019-01-12 22:31:01,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:01,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:31:02,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:31:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:31:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:31:02,152 INFO L87 Difference]: Start difference. First operand 35933 states and 112645 transitions. Second operand 6 states. [2019-01-12 22:31:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:03,747 INFO L93 Difference]: Finished difference Result 72510 states and 225561 transitions. [2019-01-12 22:31:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:31:03,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-12 22:31:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:03,882 INFO L225 Difference]: With dead ends: 72510 [2019-01-12 22:31:03,882 INFO L226 Difference]: Without dead ends: 72446 [2019-01-12 22:31:03,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:31:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2019-01-12 22:31:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 40893. [2019-01-12 22:31:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40893 states. [2019-01-12 22:31:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40893 states to 40893 states and 126623 transitions. [2019-01-12 22:31:04,633 INFO L78 Accepts]: Start accepts. Automaton has 40893 states and 126623 transitions. Word has length 64 [2019-01-12 22:31:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 40893 states and 126623 transitions. [2019-01-12 22:31:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:31:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 40893 states and 126623 transitions. [2019-01-12 22:31:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 22:31:04,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:04,651 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] [2019-01-12 22:31:04,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1999395037, now seen corresponding path program 1 times [2019-01-12 22:31:04,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:04,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:04,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:04,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:31:04,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:31:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:31:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:04,741 INFO L87 Difference]: Start difference. First operand 40893 states and 126623 transitions. Second operand 3 states. [2019-01-12 22:31:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:05,092 INFO L93 Difference]: Finished difference Result 46898 states and 143100 transitions. [2019-01-12 22:31:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:31:05,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-01-12 22:31:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:05,166 INFO L225 Difference]: With dead ends: 46898 [2019-01-12 22:31:05,166 INFO L226 Difference]: Without dead ends: 46898 [2019-01-12 22:31:05,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46898 states. [2019-01-12 22:31:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46898 to 40581. [2019-01-12 22:31:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40581 states. [2019-01-12 22:31:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40581 states to 40581 states and 123025 transitions. [2019-01-12 22:31:05,751 INFO L78 Accepts]: Start accepts. Automaton has 40581 states and 123025 transitions. Word has length 70 [2019-01-12 22:31:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:05,751 INFO L480 AbstractCegarLoop]: Abstraction has 40581 states and 123025 transitions. [2019-01-12 22:31:05,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:31:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40581 states and 123025 transitions. [2019-01-12 22:31:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 22:31:05,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:05,768 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] [2019-01-12 22:31:05,768 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash -627497849, now seen corresponding path program 1 times [2019-01-12 22:31:05,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:05,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:06,261 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 22:31:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:06,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:06,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:31:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:31:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:31:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:31:06,414 INFO L87 Difference]: Start difference. First operand 40581 states and 123025 transitions. Second operand 6 states. [2019-01-12 22:31:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:07,710 INFO L93 Difference]: Finished difference Result 50181 states and 152193 transitions. [2019-01-12 22:31:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:31:07,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-01-12 22:31:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:07,792 INFO L225 Difference]: With dead ends: 50181 [2019-01-12 22:31:07,792 INFO L226 Difference]: Without dead ends: 49877 [2019-01-12 22:31:07,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:31:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49877 states. [2019-01-12 22:31:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49877 to 45421. [2019-01-12 22:31:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45421 states. [2019-01-12 22:31:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45421 states to 45421 states and 138099 transitions. [2019-01-12 22:31:08,799 INFO L78 Accepts]: Start accepts. Automaton has 45421 states and 138099 transitions. Word has length 71 [2019-01-12 22:31:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:08,799 INFO L480 AbstractCegarLoop]: Abstraction has 45421 states and 138099 transitions. [2019-01-12 22:31:08,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:31:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45421 states and 138099 transitions. [2019-01-12 22:31:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 22:31:08,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:08,815 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] [2019-01-12 22:31:08,815 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1870518088, now seen corresponding path program 1 times [2019-01-12 22:31:08,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:08,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:08,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:08,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:31:08,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:31:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:31:08,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:08,929 INFO L87 Difference]: Start difference. First operand 45421 states and 138099 transitions. Second operand 3 states. [2019-01-12 22:31:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:09,110 INFO L93 Difference]: Finished difference Result 37781 states and 112029 transitions. [2019-01-12 22:31:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:31:09,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-12 22:31:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:09,167 INFO L225 Difference]: With dead ends: 37781 [2019-01-12 22:31:09,167 INFO L226 Difference]: Without dead ends: 37565 [2019-01-12 22:31:09,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37565 states. [2019-01-12 22:31:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37565 to 35657. [2019-01-12 22:31:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35657 states. [2019-01-12 22:31:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35657 states to 35657 states and 105829 transitions. [2019-01-12 22:31:09,625 INFO L78 Accepts]: Start accepts. Automaton has 35657 states and 105829 transitions. Word has length 71 [2019-01-12 22:31:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:09,626 INFO L480 AbstractCegarLoop]: Abstraction has 35657 states and 105829 transitions. [2019-01-12 22:31:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:31:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 35657 states and 105829 transitions. [2019-01-12 22:31:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 22:31:09,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:09,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:09,640 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1910165806, now seen corresponding path program 1 times [2019-01-12 22:31:09,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:09,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:09,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:09,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:09,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:09,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:31:09,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:31:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:31:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:09,889 INFO L87 Difference]: Start difference. First operand 35657 states and 105829 transitions. Second operand 5 states. [2019-01-12 22:31:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:10,286 INFO L93 Difference]: Finished difference Result 11493 states and 28946 transitions. [2019-01-12 22:31:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:31:10,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-12 22:31:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:10,298 INFO L225 Difference]: With dead ends: 11493 [2019-01-12 22:31:10,298 INFO L226 Difference]: Without dead ends: 9745 [2019-01-12 22:31:10,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:31:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2019-01-12 22:31:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 7550. [2019-01-12 22:31:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7550 states. [2019-01-12 22:31:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7550 states to 7550 states and 18840 transitions. [2019-01-12 22:31:10,387 INFO L78 Accepts]: Start accepts. Automaton has 7550 states and 18840 transitions. Word has length 72 [2019-01-12 22:31:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:10,388 INFO L480 AbstractCegarLoop]: Abstraction has 7550 states and 18840 transitions. [2019-01-12 22:31:10,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:31:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7550 states and 18840 transitions. [2019-01-12 22:31:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:10,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:10,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:10,396 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:10,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash -945545022, now seen corresponding path program 1 times [2019-01-12 22:31:10,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:10,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:10,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:10,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:31:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:31:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:31:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:10,602 INFO L87 Difference]: Start difference. First operand 7550 states and 18840 transitions. Second operand 4 states. [2019-01-12 22:31:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:10,912 INFO L93 Difference]: Finished difference Result 8929 states and 21890 transitions. [2019-01-12 22:31:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:31:10,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 22:31:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:10,925 INFO L225 Difference]: With dead ends: 8929 [2019-01-12 22:31:10,925 INFO L226 Difference]: Without dead ends: 8929 [2019-01-12 22:31:10,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2019-01-12 22:31:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 8223. [2019-01-12 22:31:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8223 states. [2019-01-12 22:31:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 20295 transitions. [2019-01-12 22:31:11,012 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 20295 transitions. Word has length 101 [2019-01-12 22:31:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:11,012 INFO L480 AbstractCegarLoop]: Abstraction has 8223 states and 20295 transitions. [2019-01-12 22:31:11,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:31:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 20295 transitions. [2019-01-12 22:31:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:11,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:11,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:11,022 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -934228895, now seen corresponding path program 1 times [2019-01-12 22:31:11,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:11,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:11,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:11,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:11,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:31:11,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:31:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:31:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:31:11,280 INFO L87 Difference]: Start difference. First operand 8223 states and 20295 transitions. Second operand 7 states. [2019-01-12 22:31:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:11,733 INFO L93 Difference]: Finished difference Result 13159 states and 31300 transitions. [2019-01-12 22:31:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:31:11,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-01-12 22:31:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:11,748 INFO L225 Difference]: With dead ends: 13159 [2019-01-12 22:31:11,748 INFO L226 Difference]: Without dead ends: 13073 [2019-01-12 22:31:11,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:31:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13073 states. [2019-01-12 22:31:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13073 to 10862. [2019-01-12 22:31:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10862 states. [2019-01-12 22:31:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 26109 transitions. [2019-01-12 22:31:11,877 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 26109 transitions. Word has length 101 [2019-01-12 22:31:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:11,877 INFO L480 AbstractCegarLoop]: Abstraction has 10862 states and 26109 transitions. [2019-01-12 22:31:11,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:31:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 26109 transitions. [2019-01-12 22:31:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:11,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:11,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:11,892 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1350634560, now seen corresponding path program 1 times [2019-01-12 22:31:11,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:11,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:11,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:31:12,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:31:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:31:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:31:12,104 INFO L87 Difference]: Start difference. First operand 10862 states and 26109 transitions. Second operand 7 states. [2019-01-12 22:31:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:12,734 INFO L93 Difference]: Finished difference Result 14357 states and 33105 transitions. [2019-01-12 22:31:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:31:12,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-01-12 22:31:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:12,753 INFO L225 Difference]: With dead ends: 14357 [2019-01-12 22:31:12,753 INFO L226 Difference]: Without dead ends: 14357 [2019-01-12 22:31:12,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:31:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2019-01-12 22:31:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 11998. [2019-01-12 22:31:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11998 states. [2019-01-12 22:31:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11998 states to 11998 states and 28046 transitions. [2019-01-12 22:31:12,896 INFO L78 Accepts]: Start accepts. Automaton has 11998 states and 28046 transitions. Word has length 101 [2019-01-12 22:31:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:12,896 INFO L480 AbstractCegarLoop]: Abstraction has 11998 states and 28046 transitions. [2019-01-12 22:31:12,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:31:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11998 states and 28046 transitions. [2019-01-12 22:31:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:12,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:12,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:12,907 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1095898015, now seen corresponding path program 1 times [2019-01-12 22:31:12,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:12,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:12,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:13,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:13,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:31:13,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:31:13,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:31:13,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:13,057 INFO L87 Difference]: Start difference. First operand 11998 states and 28046 transitions. Second operand 4 states. [2019-01-12 22:31:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:13,305 INFO L93 Difference]: Finished difference Result 12476 states and 29161 transitions. [2019-01-12 22:31:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:31:13,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 22:31:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:13,321 INFO L225 Difference]: With dead ends: 12476 [2019-01-12 22:31:13,321 INFO L226 Difference]: Without dead ends: 12476 [2019-01-12 22:31:13,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2019-01-12 22:31:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 11586. [2019-01-12 22:31:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-01-12 22:31:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 27138 transitions. [2019-01-12 22:31:13,441 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 27138 transitions. Word has length 101 [2019-01-12 22:31:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:13,441 INFO L480 AbstractCegarLoop]: Abstraction has 11586 states and 27138 transitions. [2019-01-12 22:31:13,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:31:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 27138 transitions. [2019-01-12 22:31:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:13,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:13,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:13,453 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -828566685, now seen corresponding path program 1 times [2019-01-12 22:31:13,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:13,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:13,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:13,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:13,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:31:13,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:31:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:31:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:13,769 INFO L87 Difference]: Start difference. First operand 11586 states and 27138 transitions. Second operand 5 states. [2019-01-12 22:31:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:14,212 INFO L93 Difference]: Finished difference Result 13569 states and 31308 transitions. [2019-01-12 22:31:14,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:31:14,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-01-12 22:31:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:14,229 INFO L225 Difference]: With dead ends: 13569 [2019-01-12 22:31:14,229 INFO L226 Difference]: Without dead ends: 13569 [2019-01-12 22:31:14,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:31:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13569 states. [2019-01-12 22:31:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13569 to 11762. [2019-01-12 22:31:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11762 states. [2019-01-12 22:31:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11762 states to 11762 states and 27514 transitions. [2019-01-12 22:31:14,359 INFO L78 Accepts]: Start accepts. Automaton has 11762 states and 27514 transitions. Word has length 101 [2019-01-12 22:31:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:14,359 INFO L480 AbstractCegarLoop]: Abstraction has 11762 states and 27514 transitions. [2019-01-12 22:31:14,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:31:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11762 states and 27514 transitions. [2019-01-12 22:31:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:14,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:14,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:14,371 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1620942023, now seen corresponding path program 2 times [2019-01-12 22:31:14,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:14,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:14,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:14,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:14,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:31:14,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:31:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:31:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:31:14,561 INFO L87 Difference]: Start difference. First operand 11762 states and 27514 transitions. Second operand 4 states. [2019-01-12 22:31:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:14,882 INFO L93 Difference]: Finished difference Result 11762 states and 27482 transitions. [2019-01-12 22:31:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:31:14,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 22:31:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:14,908 INFO L225 Difference]: With dead ends: 11762 [2019-01-12 22:31:14,908 INFO L226 Difference]: Without dead ends: 11762 [2019-01-12 22:31:14,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11762 states. [2019-01-12 22:31:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11762 to 11306. [2019-01-12 22:31:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11306 states. [2019-01-12 22:31:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11306 states to 11306 states and 26428 transitions. [2019-01-12 22:31:15,153 INFO L78 Accepts]: Start accepts. Automaton has 11306 states and 26428 transitions. Word has length 101 [2019-01-12 22:31:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 11306 states and 26428 transitions. [2019-01-12 22:31:15,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:31:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11306 states and 26428 transitions. [2019-01-12 22:31:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:15,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:15,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:15,178 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash -686543513, now seen corresponding path program 2 times [2019-01-12 22:31:15,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:15,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:15,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:15,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:31:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:15,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:15,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:31:15,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:31:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:31:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:15,297 INFO L87 Difference]: Start difference. First operand 11306 states and 26428 transitions. Second operand 3 states. [2019-01-12 22:31:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:15,497 INFO L93 Difference]: Finished difference Result 14072 states and 32866 transitions. [2019-01-12 22:31:15,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:31:15,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 22:31:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:15,521 INFO L225 Difference]: With dead ends: 14072 [2019-01-12 22:31:15,521 INFO L226 Difference]: Without dead ends: 14072 [2019-01-12 22:31:15,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:31:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2019-01-12 22:31:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 14016. [2019-01-12 22:31:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14016 states. [2019-01-12 22:31:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 32745 transitions. [2019-01-12 22:31:15,858 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 32745 transitions. Word has length 101 [2019-01-12 22:31:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:15,858 INFO L480 AbstractCegarLoop]: Abstraction has 14016 states and 32745 transitions. [2019-01-12 22:31:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:31:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 32745 transitions. [2019-01-12 22:31:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:31:15,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:15,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:15,885 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash -475192600, now seen corresponding path program 1 times [2019-01-12 22:31:15,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:15,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:15,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:15,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:31:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:31:16,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:31:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:31:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:31:16,150 INFO L87 Difference]: Start difference. First operand 14016 states and 32745 transitions. Second operand 6 states. [2019-01-12 22:31:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:18,117 INFO L93 Difference]: Finished difference Result 17046 states and 39564 transitions. [2019-01-12 22:31:18,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:31:18,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-01-12 22:31:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:18,138 INFO L225 Difference]: With dead ends: 17046 [2019-01-12 22:31:18,139 INFO L226 Difference]: Without dead ends: 17046 [2019-01-12 22:31:18,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:31:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17046 states. [2019-01-12 22:31:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17046 to 14008. [2019-01-12 22:31:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14008 states. [2019-01-12 22:31:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14008 states to 14008 states and 32659 transitions. [2019-01-12 22:31:18,292 INFO L78 Accepts]: Start accepts. Automaton has 14008 states and 32659 transitions. Word has length 101 [2019-01-12 22:31:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:18,292 INFO L480 AbstractCegarLoop]: Abstraction has 14008 states and 32659 transitions. [2019-01-12 22:31:18,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:31:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14008 states and 32659 transitions. [2019-01-12 22:31:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:31:18,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:18,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:18,305 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1385625723, now seen corresponding path program 1 times [2019-01-12 22:31:18,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:18,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:18,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:18,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:18,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:31:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:31:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:31:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:31:18,530 INFO L87 Difference]: Start difference. First operand 14008 states and 32659 transitions. Second operand 10 states. [2019-01-12 22:31:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:19,186 INFO L93 Difference]: Finished difference Result 16241 states and 37810 transitions. [2019-01-12 22:31:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:31:19,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-01-12 22:31:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:19,192 INFO L225 Difference]: With dead ends: 16241 [2019-01-12 22:31:19,193 INFO L226 Difference]: Without dead ends: 3028 [2019-01-12 22:31:19,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:31:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-01-12 22:31:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 3026. [2019-01-12 22:31:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2019-01-12 22:31:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7177 transitions. [2019-01-12 22:31:19,221 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7177 transitions. Word has length 103 [2019-01-12 22:31:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:19,222 INFO L480 AbstractCegarLoop]: Abstraction has 3026 states and 7177 transitions. [2019-01-12 22:31:19,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:31:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7177 transitions. [2019-01-12 22:31:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:31:19,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:19,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:19,226 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash 857098671, now seen corresponding path program 1 times [2019-01-12 22:31:19,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:19,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:19,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:19,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:31:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:31:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:31:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:31:19,583 INFO L87 Difference]: Start difference. First operand 3026 states and 7177 transitions. Second operand 5 states. [2019-01-12 22:31:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:20,213 INFO L93 Difference]: Finished difference Result 3457 states and 8124 transitions. [2019-01-12 22:31:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:31:20,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-01-12 22:31:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:20,218 INFO L225 Difference]: With dead ends: 3457 [2019-01-12 22:31:20,218 INFO L226 Difference]: Without dead ends: 3433 [2019-01-12 22:31:20,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:31:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-01-12 22:31:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3034. [2019-01-12 22:31:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-01-12 22:31:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 7194 transitions. [2019-01-12 22:31:20,247 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 7194 transitions. Word has length 103 [2019-01-12 22:31:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:20,248 INFO L480 AbstractCegarLoop]: Abstraction has 3034 states and 7194 transitions. [2019-01-12 22:31:20,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:31:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 7194 transitions. [2019-01-12 22:31:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:31:20,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:20,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:20,251 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash 613678253, now seen corresponding path program 1 times [2019-01-12 22:31:20,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:20,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:20,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:20,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:31:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:31:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:31:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:31:20,610 INFO L87 Difference]: Start difference. First operand 3034 states and 7194 transitions. Second operand 7 states. [2019-01-12 22:31:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:20,981 INFO L93 Difference]: Finished difference Result 3382 states and 8078 transitions. [2019-01-12 22:31:20,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:31:20,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-01-12 22:31:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:20,986 INFO L225 Difference]: With dead ends: 3382 [2019-01-12 22:31:20,986 INFO L226 Difference]: Without dead ends: 3382 [2019-01-12 22:31:20,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:31:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2019-01-12 22:31:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 2976. [2019-01-12 22:31:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-01-12 22:31:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 7076 transitions. [2019-01-12 22:31:21,016 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 7076 transitions. Word has length 103 [2019-01-12 22:31:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:21,016 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 7076 transitions. [2019-01-12 22:31:21,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:31:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 7076 transitions. [2019-01-12 22:31:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:31:21,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:21,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:21,020 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2075258252, now seen corresponding path program 1 times [2019-01-12 22:31:21,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:21,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:31:21,272 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 22:31:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:31:21,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:31:21,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 22:31:21,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:31:21,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:31:21,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:31:21,391 INFO L87 Difference]: Start difference. First operand 2976 states and 7076 transitions. Second operand 13 states. [2019-01-12 22:31:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:22,277 INFO L93 Difference]: Finished difference Result 4731 states and 11002 transitions. [2019-01-12 22:31:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:31:22,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-01-12 22:31:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:22,282 INFO L225 Difference]: With dead ends: 4731 [2019-01-12 22:31:22,283 INFO L226 Difference]: Without dead ends: 3429 [2019-01-12 22:31:22,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:31:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2019-01-12 22:31:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3027. [2019-01-12 22:31:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3027 states. [2019-01-12 22:31:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 7131 transitions. [2019-01-12 22:31:22,310 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 7131 transitions. Word has length 103 [2019-01-12 22:31:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:22,310 INFO L480 AbstractCegarLoop]: Abstraction has 3027 states and 7131 transitions. [2019-01-12 22:31:22,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:31:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 7131 transitions. [2019-01-12 22:31:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:31:22,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:22,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:31:22,314 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash -932371670, now seen corresponding path program 2 times [2019-01-12 22:31:22,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:22,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:31:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:31:22,407 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:31:22,609 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:31:22,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:31:22 BasicIcfg [2019-01-12 22:31:22,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:31:22,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:31:22,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:31:22,611 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:31:22,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:29:41" (3/4) ... [2019-01-12 22:31:22,617 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:31:22,825 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:31:22,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:31:22,829 INFO L168 Benchmark]: Toolchain (without parser) took 103503.72 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 946.0 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,831 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:31:22,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,832 INFO L168 Benchmark]: Boogie Preprocessor took 68.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:31:22,832 INFO L168 Benchmark]: RCFGBuilder took 1354.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,832 INFO L168 Benchmark]: TraceAbstraction took 100886.70 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,832 INFO L168 Benchmark]: Witness Printer took 217.74 ms. Allocated memory is still 6.5 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:22,834 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 878.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.11 ms. Allocated memory is still 1.1 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 68.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1354.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100886.70 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 217.74 ms. Allocated memory is still 6.5 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] -1 pthread_t t14; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK -1 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] -1 pthread_t t15; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK -1 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L753] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 100.6s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 32.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9002 SDtfs, 11025 SDslu, 20340 SDs, 0 SdLazy, 6693 SolverSat, 470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 58 SyntacticMatches, 23 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201216occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 53.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 429353 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2081 NumberOfCodeBlocks, 2081 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1953 ConstructedInterpolants, 0 QuantifiedInterpolants, 359555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...